-
Notifications
You must be signed in to change notification settings - Fork 0
/
Binary Tree to BST.cpp
57 lines (46 loc) · 1.21 KB
/
Binary Tree to BST.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
class Solution{
public:
// The given root is the root of the Binary Tree
// Return the root of the generated BST
Node *binaryTreeToBST (Node *root)
{
vector<int> values;
function<void(Node *)> dfs = [&](Node * cur) {
if(cur == nullptr)
return;
values.push_back(cur -> data);
dfs(cur -> left);
dfs(cur -> right);
};
dfs(root);
sort(values.begin(), values.end(), greater<int>());
function<void(Node *)> build = [&](Node * cur) {
if(cur == nullptr)
return;
build(cur -> left);
cur -> data = values.back();
values.pop_back();
build(cur -> right);
};
build(root);
return root;
}
};
//{ Driver Code Starts.
int main()
{
int t;
scanf("%d\n", &t);
while (t--)
{
string s;
getline(cin,s);
Node* root = buildTree(s);
Solution obj;
Node *res = obj.binaryTreeToBST (root);
printInorder(res);
cout<<endl;
}
return 0;
}
// } Driver Code Ends