| 19 | } |
| 20 | |
| 21 | BSTNode* Insert(BSTNode* root, int data) //BST** root |
| 22 | { |
| 23 | if(root == NULL) //*root |
| 24 | { |
| 25 | root = GetNewNode(data); //*root |
| 26 | } |
| 27 | else if(data <= root -> data) |
| 28 | { |
| 29 | root -> left = Insert(root -> left, data); //insert data in left subtree |
| 30 | } |
| 31 | else |
| 32 | { |
| 33 | root -> right = Insert(root -> right, data); |
| 34 | } |
| 35 | return root; |
| 36 | } |
| 37 | |
| 38 | bool Search(BSTNode* root, int data) |
| 39 | { |