Start learning →

A tree that requires the left and right subtrees to be balanced at every node is an:

AAPI tree
BASCII tree
CALU tree
DAVL tree
Answer & Solution
Correct answer: D. AVL tree
1. A self balancing rule keeps the height small. 2. One classic rule carries two inventors' initials. 3. That is the AVL tree. _Source: OpenStax Introduction to Computer Science, Chapter 3, Data Structures and Algorithms._
Practise this question with Quill — Coding Interview Prep →

Keep practising Data Structures and Algorithms

Browse all Data Structures and Algorithms questions for Coding Interview Prep, or explore more Computer Science topics.

Start a Data Structures and Algorithms lesson →
Related questions
Algorithms bingoType the numberSort the computing ideasArray or linkedSlice the structuresRun the algorithm gatesPop the growth classesCatch the data structures