Tree bottom view

#1

please telll me what ttype of tree will be formed it
1 2 3 4 5 6 -1 -1 -1 -1 -1 -1 -1
this is the level order input?

#2

@Shreya-Gupta-2383169445069382
You are given the level order traversal of the tree as input.
Let us consider the sample testcase given in the problem
Input :
1 2 3 4 5 6 -1 -1 -1 -1 -1 -1 -1

Sample Output :
4 2 6 3

We are given the level order input in this problem

Here the tree looks like

             1                                 
          /     \
        2         3                         
      /    \     /     
     4      5   6

The botttom view of this tree as we can see from left to write would be
4 2 6 3
Note the situation of ambiguity at the third node since 5 from left subtree and 6 from right subtree at present at the same structural position at the same height so we pick the one that was created afterwards , that is , the one from the right subtree.

This problem is solved using Hashing with trees.

The input is quite similar to the BFS algorithm.
Use this code snippet for the input - https://ide.codingblocks.com/s/154779

#3

thank you that cleared everything :slight_smile:

#4

@Shreya-Gupta-2383169445069382
Kindly mark this doubt as resolved in your doubts section if your issue is solved.

#5

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.