chap14-16

In an abstract data type, _______.

• the ADT implementation is known

• the ADT implementation is hidden

• the ADT public operations are hidden

• Nothing is hidden

A stack is a _________ structure

• FIFO

• LIFO

• DIFO

• SIFO

A(n) _______ list is also known as a queue

• LIFO

• FIFO

• unordered

• ordered

If A is the first data element input into a stack, followed by B, C, and D, then _______ is the first element to be removed.

• A

• B

• C

• D

If A is the first data element input into a queue, followed by B, C, and D, then _______ is the first element to be removed

• A

• B

• C

• D

The pop operation _______ of the stack

• deletes an item from the top

• deletes an item from the bottom

• inserts an item at the top

• inserts an item at the bottom

The push operation _______ of the stack.

• deletes an item from the top

• deletes an item from the bottom

• inserts an item at the top

• inserts an item at the bottom

In a binary tree, each node has _______ two subtrees

• more than

• less than

• at most

• at least

In preorder traversal of a binary tree, the ______.

• left subtree is processed first

• right subtree is processed first

• root is processed first

• the root is never processed

In _______ traversal of a binary tree, the right subtree is processed last.

• preorder

• inorder

• postorder

• any order