1099. Build A binary Search tree (30) "Binary Tree"--pat (Advanced level) practise

Topic Information

1099. Build A Binary Search Tree (30)

Time limit (MS)
Memory Limit 65536 KB
Code length limit 16000 B
A binary Search Tree (BST) is recursively defined as a Binary Tree which have 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 is binary search trees.
Given the structure of a binary tree and a sequence of distinct integer keys, there is only one-through to fill these keys int o The tree so, the resulting tree satisfies the definition of a BST. You is 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 the one test case. For each case, the first line gives a positive integer N (<=100) which are 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 was numbered from 0 to N-1, and 0 was always the root. If one child is missing, then-1 would represent the NULL child pointer. Finally N Distinct integer keys is given in the last line.

Output Specification:

For each test case, print in one line the level order traversal sequence of this tree. All the numbers must is 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

Problem-Solving Ideas AC code

1099. Build A binary Search tree (30) "Binary Tree"--pat (Advanced level) practise