Question

Binary Search Tree (C++) Input Two lines. The first line is a integer n; the second line are n numbers. Output Two lines. First line is the in-order traversal; second line is the post-order traversal. Sample Input 8 23 45 12 6 7 89 13 47 Sample Output 6 7 12 13 23 45 47 89 7 6 13 12 47 89 45 23 Hint If meet equal number, go through the right tree.

Answer 1

the code is implemented with the comments which will help you understand the code.

in the code we are using insert function to create the tree and inorder method to print inorder traversal and postorder method to print postorder traversal

here is the code:

#include<iostream>
using namespace std;

struct Bstnode{              //this is the tree node
   int val;
   struct Bstnode *left;
   struct Bstnode *right;
}*root;

struct Bstnode* insert(struct Bstnode * root,int val)     //this is the insert function to insert the values into the tree
{
   if(root==NULL)         //whenever we find the node null means we have to insert node here
   {
       struct Bstnode *nod=new struct Bstnode;
       nod->val=val;
       nod->left=NULL;
       nod->right=NULL;
       return nod;
   }
   if(root->val> val)                //when value is smaller then our node will go into the left
       root->left=insert(root->left,val);
   else
       root->right=insert(root->right,val);      //otherwise value will go to the right
}

void inorder(struct Bstnode* root)           //this is recursive inorder function
{
   if(root==NULL)
       return ;
   inorder(root->left);               //inorder follows left root fight policy which is implemented
   cout<<root->val<<" ";
   inorder(root->right);
}
void postorder(struct Bstnode* root)    //recursive post order function
{
   if(root==NULL)
       return;
   postorder(root->left);                 //postorder follows left right root policy which is implemented
   postorder(root->right);
   cout<<root->val<<" ";
}
int main()
{
   int n;
   cin>>n;
   root=NULL;             //initially root is null as no element in the tre
   for(int i=0;i<n;i++)
   {
       int a;
       cin>>a;
       root=insert(root,a);

here is the ss of the output

I hope this will help you so please give positive ratings :)))
   }
   inorder(root);
   cout<<"\n";
   postorder(root);
}

here is the ss of the code