| 117 | } |
| 118 | |
| 119 | struct Node *minValueNode(struct Node *node) |
| 120 | { |
| 121 | struct Node *current = node; |
| 122 | |
| 123 | while (current->left != NULL) |
| 124 | current = current->left; |
| 125 | |
| 126 | return current; |
| 127 | } |
| 128 | |
| 129 | // Delete a nodes |
| 130 | struct Node *deleteNode(struct Node *root, int key) |