Given a binary tree, return the level order traversal of its nodes’ values. (i.e., from left to left, level by level). Once, node has not children go for parent where it has unvisited children.
<code> 1
/
2 3
/ /
4 5 6 7
</code>
<code> 1
/
2 3
/ /
4 5 6 7
</code>
1
/
2 3
/ /
4 5 6 7
First traverse 1,2,4 now 4 has no children
else part 4, 2 then 2, 5
5,2,1,3
I was looking for this solution but reverse node traversal not working fine for me. Any suggestion welcome.