1115 Counting Nodes in a BST（静态二叉树）

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 [−1000,1000] 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

 题意：给出一颗二叉查找树的插入顺序，根据这个插入数据，算出最后一层有多少个节点，倒数第二层有多少节点。

思路：BST都可以根据插入顺序，建立树，然后用dfs遍历，dep[i]=n表示有n个节点高度为i；

#include <iostream>
using namespace std;
struct node{
    int data;
    int lchild,rchild;
}Node[1010];
int dep[1010];
int index=0,maxdepth=-1;
int newnode(int ans){
    index++;
    Node[index]={ans,-1,-1};
    return index;
}
void insert(int &root,int data){
    if (root==-1){
        root = newnode(data);
        return;
    }
    if (data <= Node[root].data) insert(Node[root].lchild,data);
    else insert(Node[root].rchild,data);
}
void dfs(int root,int depth){
    if (root==-1) {
        maxdepth = max(depth,maxdepth);
        return;
    }
    dep[depth]++;
    dfs(Node[root].lchild,depth+1);
    dfs(Node[root].rchild,depth+1);
}
int main() {
    int m;
    cin>>m;
    int root=-1;
    for (int i = 0; i < m; ++i) {
        int a;
        cin>>a;
        insert(root,a);
    }
    dfs(root,0);
    cout<<dep[maxdepth-1]<<" + "<<dep[maxdepth-2]<<" = "<<dep[maxdepth-1]+dep[maxdepth-2];
}