PAT 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 <cstdio>
#include <vector>
#include <cstdlib>
using namespace std;
struct node
{
  int val;
  struct node* left;
  struct node* right;
};
node* insert(node* root, int value)
{
  if(root == NULL)
  {
    root = (struct node*)malloc(sizeof(struct node));
    root->val = value;
    root->left = root->right = NULL;
  }
  else if(root->val >= value)
    root->left = insert(root->left,value);
  else if(root->val < value)
    root->right = insert(root->right,value);
  return root;
}
int maxDepth = -1;
vector<int> num(1001);
void dfs(node* root,int depth)
{
  if(root == NULL)
  {
    maxDepth = max(maxDepth,depth);
    return;
  }
  num[depth]++;
  dfs(root->left,depth+1);
  dfs(root->right,depth+1);
}
int main()
{
  int n;
  scanf("%d",&n);
  struct node* root = NULL;
  for(int i = 0; i < n; i++)
  {
    int value;
    scanf("%d",&value);
    root = insert(root,value);
  }
  dfs(root,0);
  printf("%d + %d = %d\n",num[maxDepth-1],num[maxDepth-2],num[maxDepth-2]+num[maxDepth-1]);
  return 0;
}