#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis

A binary search tree whose left subtree and right subtree differ in height by at most 1 unit is called ____________________.

Answer

AVL tree