1099. Build A Binary Search Tree (30)

freopen("Text.txt", "r", stdin); 输入输出重定向，神器

建立二叉树，注意中序遍历和指针的使用

 

时间限制

100 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties:

The left subtree of a node contains only nodes with keys less than the node's key.The right subtree of a node contains only nodes with keys greater than or equal to the node's key.Both the left and right subtrees must also be binary search trees.

Given the structure of a binary tree and a sequence of distinct integer keys, there is only one way to fill these keys into the tree so that the resulting tree satisfies the definition of a BST. You are supposed to output the level order traversal sequence of that tree. The sample is illustrated by Figure 1 and 2.

Input Specification:

Each input file contains one test case. For each case, the first line gives a positive integer N (<=100) which is the total number of nodes in the tree. The next N lines each contains the left and the right children of a node in the format "left_index right_index", provided that the nodes are numbered from 0 to N-1, and 0 is always the root. If one child is missing, then -1 will represent the NULL child pointer. Finally N distinct integer keys are given in the last line.

Output Specification:

For each test case, print in one line the level order traversal sequence of that tree. All the numbers must be separated by a space, with no extra space at the end of the line.

Sample Input:

9
1 6
2 3
-1 -1
-1 4
5 -1
-1 -1
7 -1
-1 8
-1 -1
73 45 11 58 82 25 67 38 42

Sample Output:

58 25 82 11 38 67 45 73 42

来源： <http://www.patest.cn/contests/pat-a-practise/1099>

 

1. #include<iostream>
2. #include<vector>
3. #include<algorithm>
4. #include<queue>
6. using namespace std;
8. struct Node {
9. int val;
10. int left;
11. int right;
12. };
13. Node node[101];
14. vector<Node*> nnn;
15. vector<int> num;
17. void Inorder(int i) {
18. if (node[i].left != -1) {
19. Inorder(node[i].left);
20. // nnn.push_back(node[node[i].left]);
21. }
22. Node *p = (Node*)malloc(sizeof(Node));
23. p = &node[i];
24. nnn.push_back(p);
25. if (node[i].right != -1) {
26. Inorder(node[i].right);
27. // nnn.push_back(node[node[i].right]);
28. }
30. }
32. int main() {
33. int n;
34. cin >> n;
35. for (int i = 0; i < n; i++) {
36. int l, r;
37. cin >> l >> r;
38. node[i].left = l;
39. node[i].right = r;
40. }
41. for (int i = 0; i < n; i++) {
42. int temp;
43. cin >> temp;
44. num.push_back(temp);
45. }
46. sort(num.begin(), num.end());
48. Inorder(0);
50. for (int i = 0; i < n; i++) {
51. //*nnn[i].val = num[i];
52. nnn[i]->val = num[i];
53. }
55. queue<Node> q;
56. q.push(node[0]);
57. while (true)
58. {
59. if (q.front().left != -1) {
60. q.push(node[q.front().left]);
61. }
62. if (q.front().right != -1) {
63. q.push(node[q.front().right]);
64. }
66. cout << q.front().val;
67. q.pop();
68. if (q.empty())
69. break;
70. cout << " ";
71. }
72. return 0;
73. }

1. #include<iostream>
2. #include<queue>
3. #include<vector>
4. #include<algorithm>
5. #pragma warning(disable:4996)
7. using namespace std;
9. struct Node {
10. int val;
11. int left = -1;
12. int right = -1;
13. };
15. vector<int> num;
16. Node node[101];
17. int n;
18. int cnt = 0;
20. void Inorder(int root) {
21. if (node[root].left != -1)
22. Inorder(node[root].left);
24. node[root].val = num[cnt];
25. cnt++;
27. if (node[root].right != -1)
28. Inorder(node[root].right);
29. }
31. int main(void) {
32. freopen("Text.txt", "r", stdin);
33. cin >> n;
34. for (int i = 0; i < n; i++) {
35. int l, r;
36. cin >> l >> r;
37. node[i].left = l;
38. node[i].right = r;
39. }
40. for (int i = 0; i < n; i++) {
41. int temp;
42. cin >> temp;
43. num.push_back(temp);
44. }
45. sort(num.begin(), num.end());
47. Inorder(0);
49. queue<Node> q;
50. q.push(node[0]);
51. while (true)
52. {
53. if (q.front().left != -1)
54. q.push(node[q.front().left]);
56. if (q.front().right != -1)
57. q.push(node[q.front().right]);
59. cout << q.front().val;
60. q.pop();
61. if (q.empty())
62. break;
63. cout << " ";
64. }
66. return 0;
67. }

来自为知笔记(Wiz)

转载于:https://www.cnblogs.com/zzandliz/p/5023350.html