Category:AVL tree

From LiteratePrograms
Jump to: navigation, search

The first invented balanced binary search tree, AVL trees yield worst-case O(log n) time for insertion, deletion, and lookup operations.

This category currently contains no pages or media.