-
-
Notifications
You must be signed in to change notification settings - Fork 433
/
invert_tree.cpp
56 lines (46 loc) · 967 Bytes
/
invert_tree.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
//This program inverts a Binary Tree
#include<iostream>
struct Node{
int data;
Node* left,*right;
};
Node* Insert(int data){
Node* new_node=new Node();
new_node->data=data;
new_node->left=nullptr;
new_node->right=nullptr;
return new_node;
}
void Display(Node* root){
if(root==nullptr){
return;
}
Display(root->left);
std::cout<<root->data<<" ";
Display(root->right);
}
void Invert(Node* root){
if(root==nullptr){
return;
}
else{
Node* temp;
Invert(root->left);
Invert(root->right);
temp=root->left;
root->left=root->right;
root->right=temp;
}
}
int main(){
Node* root=Insert(3);
root->left=Insert(4);
root->right=Insert(5);
root->left->left=Insert(9);
root->left->right=Insert(10);
Display(root);
Invert(root);
std::cout<<"\nBinary Tree after Inversion: \n";
Display(root);
return 0;
}