Let X be a node in a binary tree.Any node on the path from X to the root is called
A) a descendant of X
B) an ancestor of X
C) a superior of X
D) a subordinate of X
Correct Answer:
Verified
Q5: In a binary tree,
A) there must be
Q6: An AVL tree is
A) a binary search
Q7: A binary tree stores items that have
Q8: Postorder traversal of a binary tree
A) first
Q9: The predecessor of a node in a
Q11: An empty binary tree has height
A) -1
B)
Q12: Let X be a node in a
Q13: The successor of a node in a
Q14: Let X be a node in a
Q15: A binary tree with just one node
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents