Successor | Solution of cracking the coding interview

 Program (Successor | Solution of cracking the coding interview):-

     Write an algorithm to find the “next” node (i.e. in-order successor ) of a given node in a binary search tree . You may assume that each node has a link to its parent.

Code (Successor | Solution of cracking the coding interview):-

#include<bits/stdc++.h>
using namespace std;

int a[50],k=0;
 struct node 
 {
     int data;
     node *left ,* right;
 };
 struct node * root=NULL;
 
 node * CreateNode()
 {
     node *temp;
     temp=new node;
     return temp;
 }
 
 void BinarySearchTree(int a)
 {
     struct node *temp,*t;
     temp=CreateNode();
     temp->data=a;
     temp->left=NULL;
     temp->right=NULL;
     if(root==NULL)
       root=temp;
     else
     {
         t=root;
         while(t!=NULL)
         {
             if(t->data>a)
             {
                 if(t->left==NULL)
                 {
                     t->left=temp;
                     t=t->left;
                 }
                 t=t->left;
             }
             else
             {
                 if(t->right==NULL)
                 {
                     t->right=temp;
                     t=t->right;
                 }
                 t=t->right;
             }
         }
     }
 }
 
 void InorderTraversal(node *t)
 {
     if(t)
     {
        InorderTraversal(t->left);
        a[k]=t->data;
        k++;
        InorderTraversal(t->right);
        
     }
 }
 int main()
 {
     int n;
     int b;
     cout<<"Enter the number of nodes "<<endl;
     cin>>n;
     cout<<"Enter the values of nodes"<<endl;
     for(int i=0;i<n;i++)
     {
         cin>>b;
         BinarySearchTree(b);
     }
     InorderTraversal(root);
     cout<<"Enter the node "<<endl;
     cin>>b;
     for(int i=0;i<k;i++)
     {
         if(b==a[i])
         {
             cout<<"Successor of "<<a[i]<<" is "<<a[i+1];
         }
     }
     
     return 0;
 }

 

Output:-

Enter the number of nodes
7
Enter the values of nodes
10 8 51 7 9 42 61
Enter the node
51
Successor of 51 is 61

After solving these questions you will get idea about how the companies asked questions in their interviews.

 

 

Recommended Post:-

 

• Primary test
• Sum or difference
• point and line

 

Wipro :-

 

• Update the booking ID | Wipro previous year question paper solution
• Pages in PDF
• Find the location id
• Find the odd digits
• Find the Product ID

 

Infytq :-

 

• Matrix sum | Infytq solution
• Counting frequency of the character by using map function

 

Key Points;-

Hackerrank:-

C-tutorial:-

 

• Micros in C
• Pointer in c
• Function declaration
• Types of user define function
• return type of function
• 2D array

See more:-

 

• c program to convert specified days into years weeks and days
  
• Print Reverse Hollow Pyramid
• Update the booking ID | Wipro previous year question paper
• Pages in PDF | Wipro previous year question paper
• Sparse Matrix in data structure
• Find the location ID | Wipro previous year Coding question
• find the odd digits | Wipro Coding question
• Find the product id | Wipro Coding question
• Difference between static and dynamic memory allocation
• What is asymptotic Notation