-
Notifications
You must be signed in to change notification settings - Fork 46
/
Copy pathbasicTreeTemplate.h
61 lines (56 loc) · 1.03 KB
/
basicTreeTemplate.h
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
#include <iostream>
#include <stack>
using namespace std;
struct Node
{
int data;
Node *right;
Node *left;
};
Node *insertNode(Node *&root, int data)
{
if (!root)
{
Node *temp = new Node();
temp->data = data;
temp->left = temp->right = NULL;
root = temp;
return root;
}
else if (data > root->data)
{
insertNode(root->right, data);
}
else
{
insertNode(root->left, data);
}
return root;
}
void displayTreePreorder(Node *root)
{
if (root)
{
cout << root->data << " ";
displayTreePreorder(root->left);
displayTreePreorder(root->right);
}
}
void displayTreePostorder(Node *root)
{
if (root)
{
displayTreePostorder(root->left);
displayTreePostorder(root->right);
cout << root->data << " ";
}
}
void displayTreeInorder(Node *root)
{
if (root)
{
displayTreeInorder(root->left);
cout << root->data << " ";
displayTreeInorder(root->right);
}
}