Given a serialized representation of a Binary Tree, can we reconstruct the original tree uniquely?
No, never
Only if the tree is a BST
Only if we have additional information about the tree structure
Yes, always
What is the time complexity of finding the LCA in a Binary Search Tree (BST) in the worst case?
O(log n)
O(1)
O(n log n)
O(n)
Which traversal algorithm is most suitable for finding the Lowest Common Ancestor (LCA) of two nodes in a Binary Tree?
Preorder Traversal
Any of the above
Postorder Traversal
Level Order Traversal
Which type of binary tree has the strictest structure, requiring all levels to be completely filled and all leaf nodes to be at the same level?
Perfect Binary Tree
Balanced Binary Tree
Complete Binary Tree
Full Binary Tree
What is the relationship between the number of leaf nodes (L) and the number of internal nodes (I) in a full binary tree?
L = I
L = I - 1
L = 2 * I
L = I + 1
Is it possible for a full binary tree to have an even number of nodes?
No
Yes
Which of the following is a common application of Binary Tree serialization?
Implementing a hash table
Sorting data
Finding the shortest path in a graph
Storing and retrieving trees in a file or database
What is the primary advantage of using an iterative approach (with a stack) over recursion for Inorder Traversal?
Iterative traversal avoids function call overhead and potential stack overflow for very deep trees.
There is no significant advantage; both approaches have similar performance.
Iterative traversal is easier to understand and implement.
Iterative traversal is generally faster.
Which of the following is NOT a typical application of Binary Search Trees?
Representing a graph data structure
Implementing sorted sets and maps
Finding the median of a dataset
Storing and retrieving data in a specific order
When deleting a node with two children in a BST, which node is typically chosen as its replacement?
Any leaf node in the subtree rooted at the node being deleted
The rightmost child of the node's left subtree
The node's immediate parent
The leftmost child of the node's right subtree