PTA甲级 1115 Counting Nodes in a BST (C++)

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(\le 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

Solution:

// Talk is cheap, show me the code
// Created by Misdirection 2021-08-26 11:34:37
// All rights reserved.

#include <iostream>
#include <vector>
#include <unordered_map>

using namespace std;

int deepestLevel = 1;
unordered_map<int, int> levels;

struct Node{
    int key;
    Node *left;
    Node *right;
    int level;

    Node(int k, int l){
        key = k;
        level = l;

        left = NULL;
        right = NULL;
    }
    ~Node(){}
};

void insert(int key, Node *root){
    if(key <= root -> key){
        if(root -> left == NULL){
            root -> left = new Node(key, root -> level + 1);
            levels[root -> level + 1]++;
            deepestLevel = max(deepestLevel, root -> level + 1);
        }
        else insert(key, root -> left);
    }
    else{
        if(root -> right == NULL){
            root -> right = new Node(key, root -> level + 1);
            levels[root -> level + 1]++;
            deepestLevel = max(deepestLevel, root -> level + 1);
        }
        else insert(key, root -> right);
    }
}

int main(){
    int n, n1, n2;
    cin >> n;

    int tmp;
    cin >> tmp;

    Node *root = new Node(tmp, 1);
    
    levels[1]++;
    
    for(int i = 0; i < n - 1; ++i){
        cin >> tmp;
        insert(tmp, root);
    }

    printf("%d + %d = %d\n", levels[deepestLevel], levels[deepestLevel - 1], levels[deepestLevel] + levels[deepestLevel - 1]);

    return 0;
}