Description
Given a binary tree, print the bottom view from left to right.
A node is included in the bottom view if it can be seen when we look at the tree from the bottom.
For the above tree, the bottom view is 5 10 3 14 25.
If there are multiple bottom-most nodes for a horizontal distance from root, then print the later one in level traversal.
Description
Given a binary tree, print the bottom view from left to right.
A node is included in the bottom view if it can be seen when we look at the tree from the bottom.
For the above tree, the bottom view is 5 10 3 14 25.
If there are multiple bottom-most nodes for a horizontal distance from root, then print the later one in level traversal.