Virtual Labs

1. The number of edges from the root to a particular node is called the ________ of that node.

a: Length Explanation

Explanation

b: Width Explanation

Explanation

c: Depth Explanation

Explanation

d: Height Explanation

Explanation

2. The number of edges from a node to its deepest leaf is called the ________ of that node.

a: Height Explanation

Explanation

b: Depth Explanation

Explanation

c: Width Explanation

Explanation

d: Length Explanation

Explanation

3. What is a full binary tree?

a: Each node has exactly two children Explanation

Explanation

b: Each node has exactly one or two children Explanation

Explanation

c: Each node has exactly zero or two children Explanation

Explanation

d: All the leaves are at the same level Explanation

Explanation

4. What is a complete binary tree?

a: A binary tree that is completely filled, with the possible exception of the bottom level, which is filled from left to right Explanation

Explanation

b: A binary tree in which every node has exactly zero or two children Explanation

Explanation

c: A tree in which all nodes have degree 2 Explanation

Explanation

d: A binary tree that is completely filled, with the possible exception of the bottom level, which is filled from right to left Explanation

Explanation

5. Which of the following is not a typical advantage or application of using tree structures?

a: Representing hierarchical data Explanation

Explanation

b: Supporting efficient searching in suitable tree structures Explanation

Explanation

c: Representing routing or hierarchical decision structures Explanation

Explanation

d: Undo/Redo operations in a notepad Explanation

Explanation

6. In a binary search tree containing distinct keys, where is a key smaller than the current node's key inserted?

a: In the left subtree Explanation

Explanation

b: In the right subtree Explanation

Explanation

c: At the root Explanation

Explanation

d: At the deepest leaf regardless of its value Explanation

Explanation

7. Which traversal of a binary search tree can be used to obtain its keys in sorted order?

a: Preorder Explanation

Explanation

b: Inorder Explanation

Explanation

c: Postorder Explanation

Explanation

d: Level-order Explanation

Explanation

8. Suppose a BST contains 40 at its root. During a search for key 25, which subtree should be explored after comparing 25 with 40?

a: The right subtree Explanation

Explanation

b: Both subtrees Explanation

Explanation

c: The left subtree Explanation

Explanation

d: Neither subtree Explanation

Explanation

9. If the same distinct keys are inserted into a binary search tree in two different orders, which result is guaranteed to be the same?

a: The tree shape Explanation

Explanation

b: The height Explanation

Explanation

c: The preorder traversal Explanation

Explanation

d: The inorder traversal Explanation

Explanation

Binary Search Tree