1099. Build A Binary Search Tree (30)

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

排序后即为BST中序遍历，再根据树形在每个结点递归添加数据，中序遍历的数据即先左子树后根再右子树，依次添加数据即可；

#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#define MAX 105

using namespace std;

int N, counter = 0;
int save[MAX][2];
int inorder[MAX];
int data[MAX];
void init()
{
    cin >> N;
    for(int i=0; i<N; i++)
    {
        cin >> save[i][0] >> save[i][1];
    }
    for(int i=0; i<N; i++)
    {
        cin >> inorder[i];
    }
    sort(inorder, inorder+N);
}

void add(int x)
{

    if(save[x][0] != -1)
    {
        add(save[x][0]);
    }
    data[x] = inorder[counter++];
    if(save[x][1] != -1)
    {
        add(save[x][1]);
    }
}

void levelorder()
{
    bool flag = true;
    queue<int> myque;
    myque.push(0);
    while(!myque.empty())
    {
        int temp = myque.front();
        myque.pop();
        if(flag)
        {
            cout << data[temp];
            flag = false;
        }
        else{
            cout << " " << data[temp];
        }
        if(save[temp][0] != -1)
            myque.push(save[temp][0]);
        if(save[temp][1] != -1)
            myque.push(save[temp][1]);
    }
}
int main()
{
    init();
    add(0);
    levelorder();
    return 0;
}