Multiple Choice
A node in a binary tree is called a(n) ____ if it has no left and right children.
A) edge
B) branch
C) leaf
D) path
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q33: A binary tree has a special node
Q34: After inserting an item in a binary
Q35: A binary tree is also a(n) _.<br>A)
Q36: The _ of a binary tree is
Q37: In C++, a function name without any
Q38: Assume the key of the left child
Q39: When traversing a binary tree, the pointer
Q41: The search function searches the binary search
Q42: A binary tree is empty if root
Q43: Three lines at the end of an