Problem 12
Mark the answers true or false as follows: A. True B. False A stack and a queue are different names for the same ADT.
Problem 14
Mark the answers true or false as follows: A. True B. False A queue displays LIFO behavior.
Problem 15
Mark the answers true or false as follows: A. True B. False A leaf in a tree is a node with no children.
Problem 16
Mark the answers true or false as follows: A. True B. False A binary tree is a tree in which each node can have zero, one, or two children.
Problem 17
Mark the answers true or false as follows: A. True B. False Binary search tree is another name for a binary tree.
Problem 18
Mark the answers true or false as follows: A. True B. False The value in the right child of a node (if it exists) in a binary search tree will be greater than the value in the node itself.
Problem 20
Mark the answers true or false as follows: A. True B. False In a graph, the vertices represent the items being modeled.
Problem 21
Mark the answers true or false as follows: A. True B. False Algorithms that use a list must know whether the list is array-based or linked.
Problem 22
Mark the answers true or false as follows: A. True B. False A list may be linear or nonlinear, depending on its implementation.
Problem 23
Mark the answers true or false as follows: A. True B. False The root of a tree is the node that has no ancestors.
