Multiple Choice
A binary tree is _______________ if all the leaves are at the highest level.
A) tall
B) complete
C) complex
D) fully grown
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q30: Find an Euler circuit for the figure
Q31: When graphs are represented pictorially using dots
Q32: On a complete graph with n vertices,
Q33: The following table shows the distance (in
Q34: We have a dictionary consisting of 500
Q36: The largest level of the tree is
Q37: One night you put a quarter into
Q38: Finding a Hamilton circuit with the shortest
Q39: If a complete graph has five vertices,
Q40: A spell-checker is using a binary tree.