Workspace/new1.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
#include<iostream>
using namespace std;
struct node
{
  int data;
node *right;
node *left;
};

class BST
{
node *root;
public:
BST() { root=NULL; }

void insert(int data,node* tmp)
{
  if(root==NULL)
 { node* n=new node;
   n->data=data; n->right=NULL; n->left=NULL;
  root=n;
}
else if(data<(tmp->data))
{ if(tmp->left!=NULL)
    { insert(data,tmp->left); }
  else { node *n=new node;
     n->data=data; n->right=NULL; n->left=NULL;
 tmp->left=n; }
}
else if(data>(tmp->data))
{
  if(tmp->right!=NULL)
   {  insert(data,tmp->right); }
   else { node  *n=new node;
         n->data=data; n->right; n->left;
  tmp->right=n; }
}
else
{ if(data==tmp->data)
  { cout<<"Already inserted"<<endl; }
}
}


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


void inorder(node *tmp1)
{ if(tmp1!=NULL)
  { inorder(tmp1->left);
   cout<<tmp1->data<< " ";
 inorder(tmp1->right);
}
}
void postodr(node *tmp)

{  if(tmp!=NULL)
  { if(tmp->left!=NULL)
     { postodr(tmp->left); }
     if(tmp->right!=NULL)
       { postodr(tmp->right); }
      cout<< tmp->data<< " ";
}
 else {cout<<"tree is empty"<<endl; }
}

void print()
{ inorder(root); }

void post()

{cout<<endl; postodr(root); }
void search(int data,node *tmp)
{ node *current=tmp;
  if(data<(tmp->data))
  { if(tmp->left!=NULL)
     { if(tmp->data==data) { cout<<"Found "<<endl;}
        else { current=current->left;); }

     }
  }
if(data>(tmp->data))
{ if(tmp->right!=NULL)
   { if(tmp->data==data) {cout<<"found "<<endl; }
    else { search(data,tmp->right); }
   }
}

}

void srch(int data)
{ search(data,root); }


};

int main()
{
  BST a;
a.addleaf(9);
a.addleaf(12);
a.addleaf(3);
a.addleaf(14);
a.addleaf(6);


a.srch(6);
a.print();
a.post();
//a.srch(14);

}