| 17 | return temp; |
| 18 | } |
| 19 | struct node *insert(struct node *node, int key) |
| 20 | { |
| 21 | if (node == NULL) |
| 22 | return newNode(key); |
| 23 | |
| 24 | if (key < node->key) |
| 25 | node->left = insert(node->left, key); |
| 26 | else if (key > node->key) |
| 27 | node->right = insert(node->right, key); |
| 28 | |
| 29 | return node; |
| 30 | } |
| 31 | void saveNode(struct node *root, vector<struct node *> &nodes) |
| 32 | { |
| 33 | if (root == NULL) |