What is the primary advantage of using a balanced BST over an unbalanced BST?
Reduced memory usage
Improved worst-case time complexity for search, insertion, and deletion
Faster insertion operations
Guaranteed constant-time search complexity
Perfect binary trees are commonly used in which of the following applications due to their balanced structure and efficient space utilization?
Trie Data Structures
Hash Tables
Heap Sort
Binary Search Trees
Is it possible for a full binary tree to have an even number of nodes?
No
Yes
What is the maximum number of nodes at level 'l' in a binary tree?
l
l^2
2l
2^l
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?
Full Binary Tree
Degenerate Binary Tree
Perfect Binary Tree
Complete Binary Tree
What is the time complexity of efficiently finding the diameter of a binary tree?
O(n)
O(log n)
O(n log n)
O(n^2)
Preorder Traversal is often used as a step in which of the following tasks?
Creating a deep copy of a Binary Tree.
Level order traversal of a Binary Tree.
Checking if two Binary Trees are mirrors of each other.
Finding the Lowest Common Ancestor (LCA) of two nodes.
When deleting a node with two children in a BST, which node is typically chosen as its replacement?
The leftmost child of the node's right subtree
The rightmost child of the node's left subtree
Any leaf node in the subtree rooted at the node being deleted
The node's immediate parent
A full binary tree with 'k' internal nodes has how many total nodes?
k + 1
k
2k
2k + 1
What is the height of a perfect binary tree with 'n' nodes?
log2(n + 1) - 1
n/2
log2(n)
n - 1