PAT甲级题目1115 Counting Nodes in a BST

题目大意：
给出一组数字，创建二叉树，求出倒数一二层的节点数量。

代码:

#include <iostream>
#include <vector>
using namespace std;
struct node 
{
    int v;
    struct node *left, *right;
};
node* build(node *root, int v) 
{
    if(root == NULL) 
    {
        root = new node();
        root->v = v;
        root->left = root->right = NULL;
    } 
    else if(v <= root->v)
        root->left = build(root->left, v);
    else
        root->right = build(root->right, v);
    return root;
}
vector<int> num(1000);
int maxdepth = -1;
void dfs(node *root, int depth) 
{

    if(root == NULL) 
    {
        maxdepth = max(depth, maxdepth);
        return ;
    }
    num[depth]++;
    dfs(root->left, depth + 1);
    dfs(root->right, depth + 1);
}
int main()
{
    int n, t;
    scanf("%d", &n);
    node *root = NULL;
    for(int i = 0; i < n; i++) 
    {
        scanf("%d", &t);
        root = build(root, t);
    }
    dfs(root, 0);
    printf("%d + %d = %d", num[maxdepth-1], num[maxdepth-2], num[maxdepth-1] + num[maxdepth-2]);
    return 0;
}