[Leetcode] Binary Tree Right View Side

Here you can use the queue

In some places see large use of two queue, a queue to save which layer of node, and then another temporary queue to save the child node of the queue, and finally when the first queue has been traversed, and then put it in the first queue.

Found in [1], it is not necessary to do so, in fact, when you start to traverse the queue, the number of node inside is known in advance, so just a known number of pop node, you can complete which layer of traversal, the last node is right view node, The next layer of child nodes generated in this process can continue to be placed in the queue.

Ok!!

[1] http://www.cnblogs.com/x1957/p/4420101.html

[Leetcode] Binary Tree Right View Side