algorithm - Connect a single level of a binary tree -
This is a description of the problem
thread a binary tree, (left, right and A sibling indicator) so that all the children of the level provided by the user are connected - 1 nearby
without using the space (i.e. No) Resolved. I can answer this question if there are some obstacles in question
-
I can add all the levels of the tree without any extra space.
-
I can add at no extra level, allowed more than a single pass
-
I have a I can add the specified level to the extra space in the same pass.
-
-
1 in a single pass
-
/ P>
-
No additional storage.
-
Comments
Post a Comment