题目内容

3 The relative position of the leaf node of any binary tree in its preorder, inorder, and postorder sequence ().

A. Definitely not changed
B. Must change
C. Sometimes changes
D. Unconfirmed

查看答案

搜索结果不匹配？点我反馈

更多问题

4 The condition for judging that a node P in the threaded binary-tree has a left child is ().

A. p->LTag==0
B. p!=NULL
C. p->lchild!=NULL
D. p->LTag==1

5 Suppose there are 4 trees in the forest T, and the number of nodes is n1, n2,n3,n4 respectively, then when the forest T is converted into a binary tree, there are ( ) nodes on the right subtree of the root node.

A. n1-1
B. n1
C. n1+n2+n3
D. n2+n3+n4

6 Construct a Huffman tree from 4 leaf nodes with weights of 9, 2, 5 and 7, then the weighted path length of the tree is ().

A. 23
B. 37
C. 44
D. 46

7 Let T be a Huffman tree with 8 leaf nodes, then the highest height of T can be ()

A. 4
B. 6
C. 8
D. 10