DSA_Unit2

What is a tree data structure?

• A linear data structure

• A hierarchical data structure

• A type of array

• A graph with cycles

In a binary tree, the maximum number of nodes at level ‘L’ is:

• 2^L

• 2^(L-1)

• 2^(L+1)

• L^2

Which of the following is NOT a type of binary tree traversal?

• Inorder

• Preorder

• Postorder

• Reverse-order

In a complete binary tree with ‘n’ nodes, the height of the tree is:

• log₂(n+1) - 1

• log₂(n) + 1

• n - 1

• 2n

A binary search tree (BST) is a binary tree with the following property:

• The left subtree contains greater values than the root

• The right subtree contains smaller values than the root

• The left subtree contains smaller values and the right subtree contains greater values

• No specific rule applies

Which of the following is NOT a valid binary tree representation?

• Linked list representation

• Array representation

• Stack representation

• Pointer representation

Which tree traversal method processes nodes in this order: left subtree → root → right subtree?

• Preorder

• Inorder

• Postorder

• Level-order

A threaded binary tree is used for:

• Reducing memory usage

• Fast searching

• Efficient traversal without recursion or stack

• Both b and c

Which of the following is an application of trees?

• Expression evaluation

• Sets representation

• Database indexing

• All of the above

Which traversal method ensures that the output is sorted for a binary search tree (BST)?

• Preorder

• Postorder

• Inorder

• Level-order