PAT 1115. Counting Nodes in a BST (30) 建树

1115. Counting Nodes in a BST (30)

时间限制

400 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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<algorithm>
#include<string.h>
#include<string>
#include<stdio.h>
#include<queue>
#include<set>
#include<deque>
using namespace std;

struct
{
    int lc=-1;
    int rc=-1;
    int flag=0;   //只是为了针对root节点而已
    int value;
    int ceng;    
}node[1005];

int p=0;
int maxx=-1;

 int inst(int now,int x,int ceng)
 {
     if(now==0&&node[0].flag==0||now==-1)
     {
         node[p].lc=node[p].rc=-1;
         node[p].value=x;
         node[p].ceng=ceng;
         if(ceng>maxx) maxx=ceng;
         node[0].flag=1;
         p++;
         return p-1;
     }
     else
     {
         if(x<=node[now].value)
            node[now].lc=inst(node[now].lc,x,ceng+1);
         else
            node[now].rc=inst(node[now].rc,x,ceng+1);
     }
       return now;
 }

int main()
{
   int n;
   cin>>n;
   for(int i=0;i<n;i++)
   {
       int x;
       cin>>x;
       inst(0,x,0);
   }
     int s1=0;
     int s2=0;
     for(int i=0;i<p;i++)
     {
         if(node[i].ceng==maxx) s1++;
         if(node[i].ceng==maxx-1) s2++;
     }
      cout<<s1<<" + "<<s2<<" = "<<s1+s2;

    return 0;
}