-
Notifications
You must be signed in to change notification settings - Fork 0
/
TreeModel.cpp
60 lines (51 loc) · 1.27 KB
/
TreeModel.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
#include <vector>
#include <stdio.h>
#include <iostream>
#include <queue>
using namespace std;
struct TreeNode
{
int val;
TreeNode *left;
TreeNode *right;
TreeNode() : val(0), left(nullptr), right(nullptr) {}
TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
};
TreeNode *genTree(vector<int> vec)
{
if (vec.empty())
return nullptr;
// 创建根节点
TreeNode *root = new TreeNode(vec[0]);
std::queue<TreeNode *> nodeQueue;
nodeQueue.push(root);
int i = 1;
// 按层次顺序构建二叉树
while (!nodeQueue.empty() && i < vec.size())
{
TreeNode *node = nodeQueue.front();
nodeQueue.pop();
// 处理左子节点
if (i < vec.size() && vec[i] != INT_MIN)
{
node->left = new TreeNode(vec[i]);
nodeQueue.push(node->left);
}
i++;
// 处理右子节点
if (i < vec.size() && vec[i] != INT_MIN)
{
node->right = new TreeNode(vec[i]);
nodeQueue.push(node->right);
}
i++;
}
return root;
}
int main()
{
vector<int> vec = {1, 2};
TreeNode *root = genTree(vec);
return 0;
}