题库 第6161页
单选题：Push and pop { 1, 3, 5, 6, 4, 7, 2 } sequentially into then out
Push and pop { 1, 3, 5, 6, 4, 7, 2 } sequentially into then out of a stack. Suppose that each number is pushed into a qu…
单选题：Given a tree of degree 3. Suppose that there are 11 leaf nodes a
Given a tree of degree 3. Suppose that there are 11 leaf nodes and 4 nodes of degree 2. Then the number of degree 3 node…
单选题：Given a tree of degree 3. Suppose that there are 3 nodes of degr
Given a tree of degree 3. Suppose that there are 3 nodes of degree 2 and 2 nodes of degree 3. Then the number of leaf no…
单选题：Given the shape of a binary tree shown by the figure below. If i
Given the shape of a binary tree shown by the figure below. If its preorder traversal sequence is { E, D, A, F, H, C, B,…
单选题：Given the shape of a binary tree shown by the figure below. If i
Given the shape of a binary tree shown by the figure below. If its inorder traversal sequence is { E, A, D, B, F, H, C,…
单选题：Insert { 18, 15, 8, 16, 17, 2 } one by one into an initially emp
Insert { 18, 15, 8, 16, 17, 2 } one by one into an initially empty AVL tree. Which of the following statements is false…
单选题：If there are 28 nodes in an AVL tree, then the maximum depth of
If there are 28 nodes in an AVL tree, then the maximum depth of the tree is \_\_\_\_. The depth of an empty tree is defi…
单选题：Using the linear algorithm to build a min-heap from the sequence
Using the linear algorithm to build a min-heap from the sequence { 28, 7, 5, 19, 3, 1 }, and then insert 4. Which one of…
单选题：Given the adjacency matrix of a graph as shown by the figure. Th
Given the adjacency matrix of a graph as shown by the figure. Then starting from V5, an impossible DFS sequence is:
