Self-balancing binary search trees are node-based binary search trees that automatically keep their height small when items are inserted or deleted. They provide efficient implementations for mutable ordered lists and can be used for other abstract data structures. The height of these trees is usually logarithmic in the number of items.
Princeton University
Spring 2023
This course surveys crucial algorithms and data structures used in modern computing, with emphasis on sorting, searching, graphs, and strings. It aims to develop implementations, understand their performance, and evaluate their effectiveness.
No concepts data
+ 25 more concepts