-
Notifications
You must be signed in to change notification settings - Fork 0
/
snap.cpp
127 lines (83 loc) · 2.3 KB
/
snap.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
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <iostream>
using namespace std;
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int data){
val = data;
left = NULL;
right = NULL;
}
};
/*
*
* 2
* / \
* 1 3
* [2, 1, 3]
* 2
* \
* 3
* \
* 1
* [2, null, 3, null, 1]
*/
void printTree(struct TreeNode* root){
queue<TreeNode*> q;
q.push(root);
struct TreeNode* curr;
while (!q.empty()){
curr = q.front(); q.pop();
if (curr == NULL){
cout<<"null, ";
continue;
}
cout<<curr->val<<", ";
if (curr->left == NULL && curr->right == NULL)
continue;
q.push(curr->left);
q.push(curr->right);
}
}
/*
TreeNode *[] generateTrees(int n)
Input: 3 -> Seq: 1, 2, 3
Outoput:
1 3 3 2 1
\ / / / \ \
3 2 1 1 3 2
/ / \ \
2 1 2 3
*/
vector<TreeNode*> generateTreeUtil(int rootVal, int leftIndex, int rightIndex) {
if (leftIndex > rightIndex) {
TreeNode* root = new TreeNode(rootVal);
vector<TreeNode*> output;
for (int rootVal = leftIndex; rootVal <= rightIndex; rootVal++){
vactor<TreeNode*> leftTrees = generateTreeUtil(rootVal, leftIndex, rootVal -1, output);
vector<TreeNode*> rightTrees = generateTreeUtil(rootVal, rootVal+1, rightIndex, output);
/*
*/
}
}
return output;
}
}
vector<TreeNode*> generateTrees(int n){
vector<TreeNode*> output;
output = generateTreeUtil(?, 1, n);
}
int main() {
/* Enter your code here. Read input from STDIN. Print output to STDOUT */
TreeNode* root = new TreeNode(1);
root->left = new TreeNode(2);
root->right = new TreeNode(3);
root->right->right = new TreeNode(4);
printTree(root);
return 0;
}