In a ______ the left and right subtrees of some node differ in height by more than one.
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: D. Unbalanced binary tree
Explanation
A height difference greater than 1 violates height balance, so the tree is unbalanced.More Data Structures and Algorithms questions
- FFTs are ______ techniques used to encode digital video and audio information and help analyse the signal in the ____ domain.
- Given six weights 4, 15, 25, 5, 8, 16, construct a 2-tree (extended binary tree) with minimum weighted path length. What is the minimum wei…
- Suppose we store n keys in a hash table of size m = n² using a hash function h chosen randomly from a universal class of hash functions. Th…
- Which of the following rotations are correctly explained in the context of an AVL tree? A. LL rotation: the new node is inserted in the lef…
- In the context of Hamiltonian problems, which of the following are correct? A. The Hamiltonian cycle problem is NP-complete. B. If G is an…
- For matrix multiplication using the simple divide-and-conquer algorithm: A. The running time is T(n) = Θ(n³) B. The running time is T(n) =…