乱序词汇1-5（Random words 1-5）.docVIP

乱序词汇1-5（Random words 1-5） Chapter six tree and binary tree 1. () 1. If the binary tree USES a binary linked list as a storage structure, there are only n - 1 non-null pointer fields in the binary tree list of n nodes. The height difference of two subtrees of each node in the 02 and binary tree is 1. The two subtrees of each node in the binary tree are ordered. Each node in the tree has two non-empty subtrees or two hollow trees. () the number of all the nodes in the binary tree is 2k-1-1, where k is the depth of the tree. () all nodes in the binary tree, if there are no non-empty left subtrees, there is no non-empty right subtree. () for a non-empty binary tree, its root node is the first layer, and its ith layer has a maximum of 2i -- 1 node. () 8. The binary chain table method is used to store the binary tree containing n nodes, and n + 1 of the 2n pointer region of the node is null pointer. () a complete binary tree with 12 nodes has five nodes with a degree of 2. (10), the key value of each node in the binary tree is greater than the left a loophole tree (if any) keyword values of all nodes, and the loophole is less than the right of the tree (if any) of all nodes keyword value. () 11. After the binary tree is followed in some sequence, any node has a clue to its prodrome and follow-up. () in the first order traversal sequence of the binary tree, any node is in front of the childs node. 2. Fill in the blanks The binary tree consisting of three nodes has ____. 02. A binary tree with a depth of 6 has ____ branches and ____ leaves. A complete binary tree with 257 nodes, whose depth is ____. If there are 700 nodes in a complete binary tree, there are ____ leaves. 05, set up a complete binary tree with 1000 nodes, then the complete binary tree is ____ a leaf node, have _____ a degree of 2 nodes, have _____ a node only not empty left subtree, have _____ a node only non-empty right subtree. A k tree with n nodes may reach the maximum depth of ____, and the minimum dept