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

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;

struct node
{
    int data;
    node* lchild;
    node* rchild;
};
node* create(node* root,int d)
{
    if(root==NULL)
    {
        root=new node;
        root->data=d;
        root->lchild=root->rchild=NULL;
    }
    else if(d<=root->data)
    {
        root->lchild=create(root->lchild,d);
    }
    else
    {
        root->rchild=create(root->rchild,d);
    }
    return root;
}
vector<int> num(1000);
int maxdepth=1;
void dfs(node* root,int depth)
{
    if(root==NULL)
    {
        maxdepth=max(maxdepth,depth);
        return;
    }
    num[depth]++;
    dfs(root->lchild,depth+1);
    dfs(root->rchild,depth+1);
}
int main()
{
    int n,t;
    cin>>n;
    node* root=NULL;
    for(int i=0;i<n;i++)
    {
        cin>>t;
        root=create(root,t);
    }
    dfs(root,0);
    printf("%d + %d = %d",num[maxdepth-1],num[maxdepth-2],num[maxdepth-1]+num[maxdepth-2]);
    return 0;
}