ICC Data Structures and Algorithms 3

Question 1

In a binary search tree (BST), where is the largest value found?

Accepted Answer

The rightmost node

Answer

In a BST, all right children are greater than their parent, so the rightmost node holds the maximum value.

Question 2

What is the maximum number of children a node can have in a binary tree?

Accepted Answer

2

Answer

By definition, a binary tree node can have at most two children: a left child and a right child.

Question 3

Which graph traversal algorithm uses a queue to visit nodes level by level?

Accepted Answer

Breadth-First Search (BFS)

Answer

BFS uses a queue to explore all neighbors at the current depth before moving to the next level.

Question 4

An AVL tree maintains balance by ensuring the height difference between left and right subtrees is at most:

Accepted Answer

1

Answer

AVL trees enforce a balance factor of -1, 0, or +1, meaning subtree heights differ by no more than 1.

Question 5

In graph theory, a directed graph where no cycle exists is called a:

Accepted Answer

Directed Acyclic Graph (DAG)

Answer

A DAG is a directed graph with no cycles, commonly used in task scheduling and dependency resolution.

(ICC) International Code Council Practice Test