Multiple Choice
An AVL tree is
A) a binary search tree in which the heights of the subtrees at each node differ by at most one
B) a binary tree in which the left and right subtree have heights that differ by at most one
C) a priority queue with a balance condition
D) a binary tree in which each child is greater than its parent
Correct Answer:
Verified
Correct Answer:
Verified
Q17: An empty binary tree has height<br>A) -1<br>B)
Q18: To find the minimum element stored in
Q19: A complete binary tree with N nodes
Q20: The successor of a node in a
Q21: When a new item is added to
Q23: Assuming a Node class<br>class Node<br>{<br>int element;<br>Node left,right;<br>Node(int
Q24: A binary tree with just one node
Q25: A binary tree stores items that have
Q26: A binary tree is a collection of
Q27: Binary trees have been used<br>A) in compilers