Is it possible for a full binary tree to have an even number of nodes?
Yes
No
When deleting a node with two children in a BST, which node is typically chosen as its replacement?
The node's immediate parent
The leftmost child of the node's right subtree
Any leaf node in the subtree rooted at the node being deleted
The rightmost child of the node's left subtree
What is the time complexity of efficiently finding the diameter of a binary tree?
O(n log n)
O(n^2)
O(log n)
O(n)
What is the space complexity of finding the LCA in a Binary Tree using a recursive approach?
O(1)
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?
Complete Binary Tree
Perfect Binary Tree
Full Binary Tree
Degenerate Binary Tree
What is the worst-case time complexity of inserting a node into a Binary Search Tree (BST)?
Given a serialized representation of a Binary Tree, can we reconstruct the original tree uniquely?
Only if the tree is a BST
No, never
Only if we have additional information about the tree structure
Yes, always
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
What is the height of a perfect binary tree with 'n' nodes?
log2(n)
n/2
log2(n + 1) - 1
n - 1
A complete binary tree with 'n' nodes has a height of?
floor(log2(n))
log2(n) + 1