Amortized data structures

self-balancing binary search tree data structure

one kind of self-balancing binary search tree

data structure that keeps track of a set of elements partitioned into a number of disjoint (nonoverlapping) subsets

self-adjusting binary search tree with the additional property that recently accessed elements are quick to access again

B-tree of order 3

heap data structure made of a forest of trees

method for algorithm analysis in computer science

random-access, variable-size list data structure that allows elements to be added or removed

type of self-balancing binary search tree

method for efficiently balancing binary search trees

type of heap data structure with relatively simple implementation and excellent practical amortized performance