CPP
cpp
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
#include <iostream>
struct node {
int data;
node* right;
node* left;
node(int d): data(d), right(nullptr), left(nullptr) { }
};
void insert(node *, int);
int main() {
node* tree = nullptr;
insert(tree, 8);
return 0;
}
//Insert a node
void insert(node *tree, int n) {
if(tree == nullptr) {
tree = new node(n);
}
if(tree->data > n)
insert(tree->left, n);
else
Enter to Rename, Shift+Enter to Preview
OUTPUT
Run