What is the maximum number of children a node can have in a binary tree?
1
2
3
Unlimited
Which of these data structures can be used to efficiently determine if a given binary tree is a valid BST?
Both Queue and Stack
Heap
Stack
Queue
What is the time complexity of finding the minimum value in a BST?
It depends on the balancing of the tree.
O(log n)
O(n)
O(1)
Which of the following is a valid approach for deleting a node with two children in a binary tree?
Swap the node with its parent
None of the above
Simply remove the node
Replace the node with its inorder successor
Nodes that share the same parent are called:
Ancestors
Cousins
Siblings
Descendants
What is the maximum possible height of a balanced binary tree with 7 nodes?
4
7
If a binary tree is considered balanced, what does it imply about its left and right subtrees?
They have the same number of nodes.
They have the same height.
One subtree is always a mirror image of the other.
They are also balanced binary trees, and their heights differ by at most 1.
A node's direct descendant in a binary tree is called its:
Sibling
Parent
Ancestor
Child
A complete binary tree with 'n' nodes will always have a height of:
log2(n)
n
floor(log2(n)) + 1
n/2
To find the maximum element in a binary tree that is not a binary search tree, which traversal method is generally most suitable?
Inorder Traversal
Postorder Traversal
Preorder Traversal
Any traversal method can be used