Translate this paragraph to make the meaning clear. ....

Data structure is the basic course of computer science, which makes it very possible for every contestant to solve this problem.

A bundle of data structure binary trees has the following properties:

1。 This is a complete binary tree; That is, every level of the tree is completely filled except the lowest possible level. This stage is from left to right.

2。 It satisfies the heap order property: the key stored in each node is greater than or equal to the key stored in its child nodes.

So this is sometimes called the maximum heap. (In addition, if it is distorted, the smallest element is always at the root node, so it is piled up. )

Binary search tree (Barium), sometimes called the node of command or sort binary tree, is the data structure of binary tree and has the following characteristics:

1。 The left subtree of a node only contains the keys of the node that are less than (greater than) the keys of the node.

2。 The right subtree of a node only contains the keys of the node that are greater than (less than) the keys of the node.

3。 The left and right subtrees on both sides must also be method of bisection trees.

Given the keys of a complete binary tree, your task is to determine its type.

Please note that both the maximum heap and the split heap are acceptable, and it is also acceptable to increase and decrease the command barium.