1115 Counting Nodes in a BST （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 or equal to the node's key.
• The right subtree of a node contains only nodes with keys greater than the node's key.
• Both the left and right subtrees must also be binary search trees.

Insert a sequence of numbers into an initially empty binary search tree. Then you are supposed to count the total number of nodes in the lowest 2 levels of the resulting tree.

Input Specification:

Each input file contains one test case. For each case, the first line gives a positive integer N (≤1000) which is the size of the input sequence. Then given in the next line are the N integers in [−10001000] which are supposed to be inserted into an initially empty binary search tree.

Output Specification:

For each case, print in one line the numbers of nodes in the lowest 2 levels of the resulting tree in the format:

n1 + n2 = n

where n1 is the number of nodes in the lowest level, n2 is that of the level above, and n is the sum.

Sample Input:

9
25 30 42 16 20 20 35 -5 28

Sample Output:

2 + 4 = 6

先建树，然后深度遍历，把每一层的节点数保存在数组中，按要求输出后两层即可。 

#include<bits/stdc++.h>
using namespace std;
typedef struct node
{
    int data;
    struct node *lchild,*rchild;
}node,*Tree;
Tree Create(Tree root,int x)
{

    if(root == NULL)
    {
        root = new node;
        root->data = x;
        root->lchild = root->rchild = NULL;
        return root;
    }
    if(x<=root->data)
        root->lchild = Create(root->lchild,x);
    else
        root->rchild = Create(root->rchild,x);
    return root;
}

int maxdepth=-1;
vector<int>v(1000);
void dfs(Tree root,int h)
{
    if(root==NULL)
        return ;
    maxdepth = max(h,maxdepth);
    v[h]++;
    dfs(root->lchild,h+1);
    dfs(root->rchild,h+1);
    return ;
}
int main()
{
    int n,x;
    Tree root = NULL;
    cin>>n;
    for(int i=0;i<n;i++)
    {
        cin>>x;
        root = Create(root,x);
    }
    dfs(root,0);
    //cout<<maxdepth<<endl;
    cout<<v[maxdepth]<<" + "<<v[maxdepth-1]<<" = "<<v[maxdepth]+v[maxdepth-1];
}