Master Tree Data Structures: A Comprehensive Guide for Graduate Students

Question 1

Which of the following is NOT a characteristic of a binary tree?

Accepted Answer

Each node can have multiple parent nodes.

Answer

Each node can have at most two child nodes.

Answer

The left child node is always less than the parent node.

Answer

The right child node is always greater than the parent node.

Question 2

What is a key characteristic of a tree data structure?

Accepted Answer

Each element can have multiple children and at most one parent.

Answer

Each element has exactly one predecessor and one successor.

Answer

Data is stored in a two-dimensional array.

Answer

Each element points to the next element in a sequence.

Question 3

Which attribute makes tree data structures particularly advantageous?

Accepted Answer

Efficiently organizing and storing hierarchical data

Answer

Faster search performance than linear data structures

Answer

Lower memory consumption than other hierarchical data structures

Answer

Simplified insertion and deletion operations

Question 4

Which of the following is not a type of binary tree?

Accepted Answer

Linked list

Answer

Complete binary tree

Answer

Full binary tree

Question 5

What is the purpose of a B-tree in a database system?

Accepted Answer

To store data in a sorted order and optimize disk I/O operations

Answer

To represent hierarchical data structures

Answer

To implement a hash table

Question 6

Which of the following is a valid expression to find the number of nodes in a binary tree using recursion?

Accepted Answer

num_nodes(root) = 1 + num_nodes(root->left) + num_nodes(root->right)

Answer

num_nodes(root) = num_nodes(root->left) + num_nodes(root->right)

Answer

num_nodes(root) = 0 + num_nodes(root->left) + num_nodes(root->right)

Question 7

What is the difference between a binary tree and a binary search tree?

Accepted Answer

A binary search tree enforces a specific ordering of nodes based on their values.

Answer

A binary search tree can only store integer values.

Answer

A binary tree always has a single root node.

Question 8

Which of the following tree properties ensures that a binary search tree remains sorted?

Accepted Answer

All nodes in the left subtree are less than their parent, and all nodes in the right subtree are greater than their parent.

Answer

The height of the tree is always balanced.

Question 9

What is the time complexity of searching for a node with a given key in a balanced binary search tree?

Accepted Answer

O(log n)

Answer

O(1)

Answer

O(n)

Answer

O(n^2)