Няма описание

Jonathan E. Landrum 305e9a4c94 Save State		преди 8 години
.gitignore	df58a5dfbc Initial commit. Adding the project to version control.	преди 10 години
EmptyCollectionException.java	df58a5dfbc Initial commit. Adding the project to version control.	преди 10 години
IndexOutOfBoundsException.java	305e9a4c94 Save State	преди 8 години
Main.java	e2b1bcff5f Saving changes	преди 10 години
NoSuchElementException.java	df58a5dfbc Initial commit. Adding the project to version control.	преди 10 години
Node.java	305e9a4c94 Save State	преди 8 години
README.md	0960106b04 Update README.md	преди 9 години
SearchHeap.java	305e9a4c94 Save State	преди 8 години
UnknownErrorException.java	305e9a4c94 Save State	преди 8 години
package.bluej	305e9a4c94 Save State	преди 8 години

Search Heap

This is a data structure I am in the process of writing. As evidenced by the name, this structure is a well-ordered tree, thus it is also searchable. It is a type of heap that keeps both the global minimum and maximum in the root node, and also keeps the local minima and maxima in their respective subtree's root. This ensures O(1) search time for the extrema, and, because it is self-balancing, it guarantees O(lg n) search time for a given element, where n is the number of elements in the collection.

A zero-padded example with integers:

             (00, 13)
             /      \
    (01, 06)          (07, 12)
       / \               / \
(02, 03) (04, 05) (08, 09) (10, 11)

README.md

Search Heap