We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Agree. The fact that testcases does not include such case is just a flaw of testcases. You don't need to be such bad as well. Imagine inteview scenario: if you show solution with assumption not stated in problem that is a red flag.
i have the exact same solution, i think this is better in terms of using stack only for traversing left subtree instead of using recursion for both left and right subtrees.
Tree : Top View
You are viewing a single comment's thread. Return to all comments →
A stack seems overdoing it in terms of space complexity, it may be less elegant, but more practical to print in place.
Not necessarily - using recursion does the same thing; mandarpathak just decided to use his own stack instead of the system stack.
Top view of the above binary tree is 2 1 3 6
How about this sample?
It is not, that example would be 213. Only the topmost left and right nodes of a tree are in the topview.
I don't think you are right.
Please refer to http://www.geeksforgeeks.org/print-nodes-top-view-binary-tree/
http://algorithms.tutorialhorizon.com/print-the-top-view-of-a-binary-tree/
You will understand the definition of the top view of a binary tree.That is an interesting question but not as simple as you think.
Yeah those links are cool and informative, but the problem is designed by a person and put on hackerrank. Look to the top comments :P
Agree. The fact that testcases does not include such case is just a flaw of testcases. You don't need to be such bad as well. Imagine inteview scenario: if you show solution with assumption not stated in problem that is a red flag.
i have the exact same solution, i think this is better in terms of using stack only for traversing left subtree instead of using recursion for both left and right subtrees.