|
|
back to boardMemory in BST Don't forget that the way to store tree in simple array when (2i)th and (2i+1)th elements are childrens of (i)th element isn't working here because in worst case it costs about 2^n memory to store this array. Edited by author 27.08.2012 19:28 |
|
|