二叉树基本题型（Two basic questions tree）.docVIP

二叉树基本题型（Two basic questions tree） Two basic questions.Txt- tree, two people at the same time made a mistake, stand up to bear the side called tolerance, the other side owed the debt, sooner or later have to return. - do not love is not love, dont fucking say we. 1, set up a complete binary tree of two there were 699 nodes, while the leaf nodes in the two binary tree for ______. Preorder traversal access sequence 2, two binary tree traversal is abdgcefh, access sequence is dgbaechf, subsequent node access sequence traversal: ______. 350 699 = n (n-1) The nodes in the two fork tree are divided into three kinds: The degree is 2, the degree is 1, and the degree is 0. That is, there are two nodes in the node, there is a child node, and there is no child (node). The total number of nodes = 2 of the node + 1 degrees of node + degree of 0 nodes In any two fork tree, the number of nodes with a degree of 2 is less than the number of nodes (leaf nodes) with a degree of 0. For example, a two fork tree with only three nodes, whose number is 2, has a node number of 1 (root node), and a node with 0 degree (leaf node) has two. Zero / \ 00 A node with no degree of 1 in a total of two forks. therefore The total number of nodes = 2 of the node + degree of 0 nodes 699 = n (n-1) --------------------------------------------------------------------------------------- First of all, we know that the rules of preorder traversal are: root node, left child node and right child node The sequence traversal is: left child node, root node, right child node The backward traversal is: left child node, right node and root node Then, for a two fork tree, the first node of the preorder must be the root node of the tree, the root node is a. In the order of dgbaechf traversal, the A is divided into the left and right sides, DGB on the left and echf on the right. So the tree can now be determined as follows: A / \ DGB echf Next, perform similar operations on the left subtree and the right subtree, respect