Bottom View of Tree

#1

How to create the binary tree from the level order input?

#2

hello @nikhil015

You can maintain a queue of nodes, push the root node inside the queue, then pop the node, but before popping, you need to push its children to the queue…
in one line -> just do level order traversal
check this u will get better clarity

node *buildtree() //build tree function to build tree level wise
{
int d;
cin>>d;
queue<node *>q;
node  * root=new node(d);
q.push(root);
int c1,c2;
while(!q.empty())
{
node *  f=q.front();
q.pop();
cin>>c1>>c2;
if(c1!=-1)
{
f->left=new node(c1);
q.push(f->left);
}
if(c2!=-1)
{
f->right=new node(c2);
q.push(f->right);
}
}
return root;
}
#3

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.