A search tree is a tree which supports efficient search, insertion and withdrawal operations. In this context the tree is used to store a finite set of keys inserted after a data ordering criterion. No duplicate keys are allowed.

A B-tree is a generalization of a binary search tree which keeps data sorted and allows searches, sequential access, insertions, and deletions in logarithmic amortized time. It is commonly used in databases and filesystems.

A Fibonacci heap is a collection of trees satisfying the minimum-heap property, that is, the key of a child is always greater than or equal to the key of the parent. This implies that the minimum key is always at the root of one of the trees.

2-3 heap, Beap, Binary heap, Binomial heap, Brodal Queue, D-ary heap, Fibonacci heap, Leftist heap, Pairing heap, Pseudo Queue, Skew heap, Soft heap, Ternary heap, Treap.

1. find-max or find-min - find the maximum item of a max-heap or a minimum item of a min-heap
2. delete-max or delete-min - removing the root node of a max/min-heap
3. increase-key or decrease-key - updating a key within a max/min-heap
4. insert - adding a new key to the heap
5. merge - joining two heaps to form a valid new heap containing all the elements of both