Multiple Choice
Which of the following is a definition of a complete binary tree?
A) A binary tree in which every level is completely filled and all nodes are as far left as possible
B) A binary tree in which no level is completely filled and all nodes are as far left as possible
C) A binary tree in which every level is completely filled and all nodes are as far right as possible
D) A binary tree in which no level is completely filled and all nodes are as far right as possible
Correct Answer:
Verified
Correct Answer:
Verified
Q15: In a graph if e=[u,v],then u and
Q16: Which data structure allows deletions at both
Q17: An ordered pair is?<br>A)Any two numbers where
Q18: The x-axis represents?<br>A)Consequence<br>B)Cause<br>C)Effect<br>D)Result
Q19: When converting a binary tree into an
Q20: Which of the following is a definition
Q21: A binary tree can be converted into
Q22: Which of the following data structure is
Q24: To represent hierarchical relationship between elements,which data
Q25: What are special pointers which point to