Binary Search Tree in C++( dynamic memory based )

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

#include<bits/stdc++.h> using namespace std; struct bst { int val; bst *left,*right; }; bst *root=nullptr; void srch(int num,bst * head) {if (head==nullptr){ cout<<"\nNumber is not present\a"<<endl; return; } if (head->val==num) { cout<<"\nNumber is present\n\a"; return; } else { if(num<head->val) srch(num,head->left); else srch(num,head->right); } } void insrt(int num) { bst *node=new bst; node->val=num; node->left=node->right=nullptr; if(root==nullptr) { root=node; }else {bst * temp=root; while(temp!=nullptr) { if(num<=temp->val) {// to the left if (temp->left!=nullptr) temp=temp->left; else {temp->left=node; return; } }else {// goto r1111ight if(temp->right!=nullptr) { temp=temp->right; }else { temp->right=node; return; } } } } } void display(bst * head) {if(head==nullptr) return; display(head->left); cout<<" "<<head->val<<" "; display(head->right); } int main() { char ch; do { cout<<"\nPress\n1 To insert\n2. to display \n 3. to search\nq to exit--->"; ch=getchar(); if(ch=='1') {int i; cout<<"\nenter number to insert-->"; cin>>i; insrt(i); cout<<"\n_________________________\n\tdisplay\n_________________________\n\n"; display(root); cout<<"\n_________________________\n\n"; } if (ch=='2') {cout<<"\n_________________________\n\tdisplay\n_________________________\n\n"; display(root); cout<<"\n_________________________\n\n"; } if(ch=='3') { int i; cout<<"\nNUMBER TO SEARCH-->"; cin>>i; srch(i,root); }fflush(stdin); cout<<" \npress Enter key to continue\n"; getchar(); }while (ch!='q'); }