If i had a binary tree structure like this:
5 .......Level 1
2 3 1 4 .......Level 2
how can i print out the levels from the bottom up?
can i use queue to print it out?
what if i used stack structure instead of queue?
what is the order then?
what kind of traversal will this be after i used stack?