1064. Complete Binary Search Tree (30)

Analysis:

Measure the test taker's knowledge about the nature of the BST + Complete Binary Tree. Note:

(1): Sort them first, and then use the middle order to build a tree because it is a complete binary tree.

(2) After creation, queues can be used for hierarchical traversal.

# Include <iostream> # include <stdio. h >#include <algorithm> # include <cstring> # include <vector> # include <queue> # include <cmath> vector <> Node *} * Node * In (level, ll, (ll> rr) up_level = pow (, (level-)-; Last_level_left = (rr-ll) +-up_level; k = pow (, (level -) -); (Last_level_left> = k) left_left = pow (, (level-)-+ Node * p = p-> value = vect [left_lef T + p-> left = In (level-, ll, ll + left_left-p-> right = In (level -, ll + left_left + level_order (Node * queue <Node *> (! Node * p = result. push_back (p-> left! = Q. push (p-> right! = Q. push (p-> printf (, result [(I =; I <result. size (); I ++ printf (cin> (I =; I <n; I + + cin> level = log2 (n) + root = In (level, n-} View Code