Multiple Choice
A binary tree with height 1 must have
A) exactly two nodes
B) two or three nodes
C) exactly three nodes
D) one or two nodes
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q29: Consider the operation of deleting the root
Q30: A complete binary tree with N nodes
Q31: The predecessor of a node in a
Q32: A complete binary tree with N nodes
Q33: To add a new element X to
Q35: A node in a binary tree that
Q36: A binary tree traversal method that visits
Q37: To find the minimum node in a
Q38: A ternary tree is like a binary
Q39: Let X be a node in a