Question 1

In a binary tree, each node has _______ two subtrees.&#10;A) more than&#10;B) less than&#10;C) at most&#10;D) at least

Accepted Answer

In a binary tree, each node can have a maximum of two subtrees, as it is a tree data structure in which each node has at most two child nodes. So, the correct choice is C, "at most".

Question 2

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.&#10;A) A&#10;B) B&#10;C) C&#10;D) D

Accepted Answer

In a queue, the first element to be input is the first element to be removed, following the principle of "first in, first out" or FIFO. Therefore, the first element A, would be the first to be removed.

Question 3

A(n) _______ list is also known as a queue.&#10;A) LIFO&#10;B) FIFO&#10;C) unordered&#10;D) ordered

Accepted Answer

A FIFO list (First-In-First-Out) is also known as a queue because it operates like a real-life queue, where the first person who enters the line is the first one to be served.

Question 4

In postorder traversal of a binary tree, the left subtree is processed _______.&#10;A) first&#10;B) second&#10;C) last&#10;D) after the right subtree

Accepted Answer

In postorder traversal of a binary tree, the process follows the order of visiting the left subtree, then the right subtree, and finally the root node. Therefore, the left subtree is processed first.

Question 5

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.&#10;A) A&#10;B) B&#10;C) C&#10;D) D

Accepted Answer

In a stack, the last element that was added (in this case, D) is the first one to be removed. This is known as Last-In-First-Out (LIFO) ordering.

Question 6

A stack is a _________ structure.&#10;A) FIFO&#10;B) LIFO&#10;C) DIFO&#10;D) SIFO

Accepted Answer

A stack is a LIFO (Last-In-First-Out) structure, meaning that the last item added to the stack will be the first one removed.

Question 7

The pop operation _______ of the stack.&#10;A) deletes an item from the top&#10;B) deletes an item from the bottom&#10;C) inserts an item at the top&#10;D) inserts an item at the bottom

Accepted Answer

The pop operation deletes the item at the top of the stack, which is the most recent item that was added to the stack. It does not insert anything into the stack or delete anything from the bottom of the stack.

Question 8

In _______ traversal of a binary tree, the right subtree is processed last.&#10;A) preorder&#10;B) inorder&#10;C) postorder&#10;D) any order

Accepted Answer

The answer of In _______ traversal of a binary tree,...

Question 9

In an inorder traversal of a binary tree, the root is processed _______.&#10;A) first&#10;B) second&#10;C) last&#10;D) two times

Accepted Answer

In an inorder traversal of a binary search tree, the nodes are visited in the following order: left subtree, root, right subtree. Therefore, the root is processed second, after the left subtree and before the right subtree.

Question 10

In _______ traversal of a binary tree, the left subtree is processed last.&#10;A) preorder&#10;B) inorder&#10;C) postorder&#10;D) out of order

Accepted Answer

The answer of In _______ traversal of a binary tree,...

Question 11

The push operation _______ of the stack.&#10;A) deletes an item from the top&#10;B) deletes an item from the bottom&#10;C) inserts an item at the top&#10;D) inserts an item at the bottom

Accepted Answer

The answer of The push operation _______ of the stack.&#10;A)...

Question 12

In postorder traversal of a binary tree, the root is processed _______.&#10;A) first&#10;B) second&#10;C) last&#10;D) after the left subtree

Accepted Answer

The answer of In postorder traversal of a binary tree,...

Question 13

In an abstract data type, _______.&#10;A) the ADT implementation is known&#10;B) the ADT implementation is hidden&#10;C) the ADT public operations are hidden&#10;D) Nothing is hidden

Accepted Answer

The answer of In an abstract data type, _______.&#10;A) the...

Deck 12: Abstract Data Types