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?
Full Binary Tree
Perfect Binary Tree
Balanced Binary Tree
Complete Binary Tree
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 generally faster.
Iterative traversal is easier to understand and implement.
What is the time complexity of efficiently finding the diameter of a binary tree?
O(n log n)
O(n)
O(log n)
O(n^2)
When performing a search for a value in a BST, what happens if the value is not found?
An error is raised.
The search continues indefinitely.
The closest value in the BST is returned.
A null pointer or a special value indicating the absence of the value is returned.
Which type of binary tree is particularly well-suited for representing relationships where each node has exactly two children (e.g., representing expressions in a compiler)?
Skewed Binary Tree
Which of the following is a common application of Binary Tree serialization?
Finding the shortest path in a graph
Implementing a hash table
Sorting data
Storing and retrieving trees in a file or database
Which of the following types of binary trees guarantees that all levels except possibly the last are completely filled, and the last level has all keys as left as possible?
Degenerate Binary Tree
Which traversal algorithm is most suitable for finding the Lowest Common Ancestor (LCA) of two nodes in a Binary Tree?
Preorder Traversal
Level Order Traversal
Postorder Traversal
Any of the above
Which type of binary tree traversal is typically used to delete all nodes in a BST?
Inorder traversal
Postorder traversal
Level-order traversal
Preorder traversal
Which of the following statements is true about AVL trees?
AVL trees guarantee a maximum height difference of 1 between the left and right subtrees of any node.
AVL trees are a type of Red-Black tree.
AVL trees do not require any rotations to maintain balance.
AVL trees are always perfectly balanced.