Multiple Choice
A binary tree with depth d is complete if
A) each level L < d has 2L nodes
B) every node that is not a leaf has 2 children
C) every node that is not a leaf has 2 children and and all nodes at level d are as far to the left as possible
D) each level L < d has 2L nodes and all nodes at level d are as far to the left as possible
Correct Answer:
Verified
Correct Answer:
Verified
Q1: To add a new element X to
Q2: The heap sort method has a worst
Q3: The depth of a binary tree<br>A) is
Q5: A sorting algorithm based on a priority
Q6: The length of the longest path from
Q7: Consider the operation of deleting the root
Q8: Assuming a Node class<br>class Node<br>{<br>int element;<br>Node left,right;<br>Node(int
Q9: A complete binary tree with N nodes
Q10: Consider the operation of deleting the root
Q11: A binary tree traversal method that recursively