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?
Balanced Binary Tree
Perfect Binary Tree
Full Binary Tree
Complete Binary Tree
Why are two stacks often used in the iterative implementation of Postorder Traversal?
Two stacks are not strictly required; one stack is sufficient for iterative Postorder Traversal.
One stack is used for the left subtree traversal, and the other for the right subtree traversal.
One stack stores the nodes to be visited, and the other stores the visited nodes.
One stack stores the nodes in preorder, and the other stores them in inorder, allowing us to derive the postorder.
Which type of binary tree traversal is typically used to delete all nodes in a BST?
Inorder traversal
Preorder traversal
Level-order traversal
Postorder traversal
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
Level Order Traversal of a Binary Tree is also known as?
Depth First Search (DFS)
Breadth First Search (BFS)
Postorder Traversal
Preorder Traversal
What is the time complexity of efficiently finding the diameter of a binary tree?
O(n)
O(log n)
O(n^2)
O(n log n)
What is the time complexity of searching for a specific value in a perfectly balanced BST?
O(1)
Preorder Traversal is often used as a step in which of the following tasks?
Checking if two Binary Trees are mirrors of each other.
Finding the Lowest Common Ancestor (LCA) of two nodes.
Creating a deep copy of a Binary Tree.
Level order traversal of a Binary Tree.
What is the primary advantage of using an iterative approach (with a stack) over recursion for Inorder Traversal?
Iterative traversal is generally faster.
Iterative traversal is easier to understand and implement.
Iterative traversal avoids function call overhead and potential stack overflow for very deep trees.
There is no significant advantage; both approaches have similar performance.
What is the primary advantage of using a balanced BST over an unbalanced BST?
Guaranteed constant-time search complexity
Faster insertion operations
Reduced memory usage
Improved worst-case time complexity for search, insertion, and deletion