What is the time complexity of searching for a specific value in a perfectly balanced BST?
O(n)
O(log n)
O(n log n)
O(1)
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)?
Complete Binary Tree
Perfect Binary Tree
Full Binary Tree
Skewed Binary Tree
What is the time complexity of finding the LCA in a Binary Search Tree (BST) in the worst case?
Inorder Traversal is particularly useful for which of the following applications?
Finding the diameter of a Binary Tree.
Printing the nodes of a BST in sorted order.
Finding the height of a Binary Tree.
Checking if a Binary Tree is balanced.
What is the worst-case time complexity of inserting a node into a Binary Search Tree (BST)?
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
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 = 2 * I
L = I - 1
L = I + 1
What is the relationship between the depth of a node and its index in an array-based representation of a complete Binary Tree?
Depth = log2(Index + 1)
Depth = 2 * Index
Depth = Index / 2
Depth = Index
Preorder Traversal is often used as a step in which of the following tasks?
Finding the Lowest Common Ancestor (LCA) of two nodes.
Level order traversal of a Binary Tree.
Creating a deep copy of a Binary Tree.
Checking if two Binary Trees are mirrors of each other.
What is the time complexity of efficiently finding the diameter of a binary tree?
O(n^2)