Reputation: 33
Not asking for how to write a code to build tree, but purely from a conceptual basis how should the tree look like if it was to be created using level order traversal from the given list
[1, 2, 3, None, 4, None, None, 5, 6, None, 7]
Here is my depiction of a binary tree that can be built using level order approach, based on my understanding. Can someone provide a conceptual explanation of how to approach this when building this tree? Should 7 be right-child of 3, as it is kind of going one level up again?
1
/ \
2 3
\ \
4 7
/ \
5 6
Upvotes: -1
Views: 18