-
Notifications
You must be signed in to change notification settings - Fork 0
/
Construct Binary Tree from String with bracket representation.cpp
100 lines (88 loc) · 1.71 KB
/
Construct Binary Tree from String with bracket representation.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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
//{ Driver Code Starts
//Initial Template for C++
#include <bits/stdc++.h>
using namespace std;
/* A binary tree node has data, pointer to left
child and a pointer to right child */
class Node
{
public:
int data;
Node *left, *right;
Node(int data)
{
this->data = data;
this->left = this->right = NULL;
}
};
/* This function is to print the inorder of the tree */
void inorder(Node *root)
{
if (root == NULL)
return;
inorder(root->left);
printf("%d ", root->data);
inorder(root->right);
}
// } Driver Code Ends
//User function Template for C++
/*
class Node
{
public:
int data;
Node *left, *right;
Node(int data)
{
this->data = data;
this->left = this->right = NULL;
}
};
*/
class Solution{
public:
// function to construct tree from string
Node* fun(string &s, int &i){
int n=s.size();
int v=0;
for(;i<n and (s[i]>='0' and s[i]<='9');i++){
v=v*10+(s[i]-'0');
}
Node* root= new Node(v);
if(s[i]=='('){
// skip opening bracket
i++;
root->left=fun(s, i);
}
if(s[i]=='('){
// skip opening bracket
i++;
root->right=fun(s, i);
}
// skip closing bracket
i++;
return root;
}
Node *treeFromString(string str){
int i=0;
return fun(str, i);
}
};
//{ Driver Code Starts.
// Driver Code
int main()
{
int t;
cin >> t;
while (t--)
{
string str;
cin >> str;
Solution obj;
Node *root = obj.treeFromString(str);
inorder(root);
cout << "\n";
}
return 0;
}
// } Driver Code Ends