-
Notifications
You must be signed in to change notification settings - Fork 36
/
Binary_tree_insertion.cpp
63 lines (50 loc) · 1.06 KB
/
Binary_tree_insertion.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
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
#include <bits/stdc++.h> // Time Complexity = O(n)
using namespace std;
class Node {
public:
int data;
Node *left;
Node *right;
Node(int d) {
data = d;
left = NULL;
right = NULL;
}
};
class Solution {
public:
void preOrder(Node *root) {
if( root == NULL )
return;
std::cout << root->data << " ";
preOrder(root->left);
preOrder(root->right);
}
/*
Node is defined as
class Node {
public:
int data;
Node *left;
Node *right;
Node(int d) {
data = d;
left = NULL;
right = NULL;
}
};
*/
Node * insert(Node * root, int x) {
if(root == NULL){
root = new Node(x);
return root;
}
if(root->data > x){
root -> left = insert(root -> left, x);
}
if(root->data < x){
root -> right = insert(root -> right, x);
}
return root;
}
};