Data StructuresData Structures AVL Trees. Balanced BST Observation BST: the shallower the better! For a BST with n nodes – Average height is O(log n)
