Workspace/BST1.cpp at master · gods-mack/Workspace · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
#include<iostream>
using namespace std;

struct node
{
  int data;
  node *right;
  node *left;
};

class BST
{
  node *root;
 public:
   BST() { root=NULL; }
 node* crtnode(int data)
 { node* n=new node;
   n->data=data;
   n->right=NULL;
   n->left=NULL;
return n;
}
void insert( int data,node *tmp)
 {
   if(root==NULL)
   { root=crtnode(data);
    }
   else if(data<(tmp->data))
  {  if(tmp->left!=NULL)
      {  insert(data,tmp->left);
        }
       else
           { tmp->left=crtnode(data);
            }
     }
  else if(data>(tmp->data))
   {
       if(tmp->right!=NULL)
        { insert(data,tmp->right); }
        else
          {
        tmp->right=crtnode(data);
          }
    }
else

{
  if(data==tmp->data) { cout<<"This is already "; }
}
}

 void addleaf(int data)
 { insert(data,root); }

void printInOrder(node* tmp)
{  //cout<<"Inorder "<<endl;
       if(tmp==NULL) return;

       printInOrder(tmp->left);
       cout<<tmp->data<<" ";
       printInOrder(tmp->right);


}
void print()
{  cout<<"Inorder "<<endl;
      printInOrder(root);
 }
void printInPost(node *tmp1)
{


if(tmp1==NULL) return;


printInPost(tmp1->left);
printInPost(tmp1->right);
cout<<tmp1->data<<" ";
}

void printInPre(node *tmp2)
{

 if(tmp2==NULL) return;
cout<<tmp2->data<<" ";
printInPre(tmp2->left);
printInPre(tmp2->right);
}

void printpost()

{  cout<<"\n PostOrder "<<endl;
printInPost(root);
}
void printpre()
{  cout<<"\n PreOrder "<<endl;
  printInPre(root);
}

};


int main()
{ BST a;
a.addleaf(9);
a.addleaf(16);
a.addleaf(14);
a.addleaf(5);
a.addleaf(3);
a.addleaf(10);
a.addleaf(23);
a.addleaf(11);
a.addleaf(20);
a.addleaf(13);
a.addleaf(15);
a.addleaf(10);
a.addleaf(2);
a.addleaf(3);
a.addleaf(4);

a.print();
a.printpost();
a.printpre();

}