Workspace/new.cpp at master · afAditya/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
#include<iostream>
using namespace std;

struct node
{
  int data; node *right,*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<<"already inserted"<<endl; }
}

}

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

void printInOrder(node* tmp)
{ if(tmp!=NULL)
 {

   printInOrder(tmp->left);

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

 // cout<<tmp->data<<" ";
 }
 }

void print()
{
     printInOrder(root);
 }

};

int main()
{ BST a;
a.addleaf(12);
a.addleaf(14);
a.addleaf(9);
a.addleaf(10);
a.addleaf(16);
a.addleaf(13);
a.addleaf(8);


a.print();


}