-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathconvertbsttobinary.cpp
More file actions
69 lines (57 loc) · 1.15 KB
/
convertbsttobinary.cpp
File metadata and controls
69 lines (57 loc) · 1.15 KB
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
64
65
66
67
68
69
#include<bits/stdc++.h>
using namespace std;
struct node
{
int key;
struct node*left;
struct node*right;
};
struct node*newNode(int key)
{
struct node*node = new node();
node->key = key;
node->left = NULL;
node->right = NULL;
return(node);
}
void addGreaterUtil(struct node*root , int *sum_ptr)
{
if(root==NULL)
{
return;
}
addGreaterUtil(root->right,sum_ptr)
*sum_ptr = *sum_ptr + root->key;
root->key = *sum_ptr;
addGreaterUtil(root->left,sum_ptr);
}
void addGreater(struct node*root)
{
int sum = 0;
addGreaterUtil(root,&sum);
}
void printInorder(struct node*node)
{
if(node==NULL)
{
return;
}
printInorder(node->left);
cout<<node->key<<" ";
printInorder(node->right);
}
int main()
{
node *root = newNode(5);
root->left = newNode(2);
root->right = newNode(13);
cout << "Inorder traversal of the "
<< "given tree" << endl;
printInorder(root);
addGreater(root);
cout << endl;
cout << "Inorder traversal of the "
<< "modified tree" << endl;
printInorder(root);
return 0;
}