Home Verkennen Help
Inloggen
jonlandrum
/
search-heap
Volgen 1
Ster 0
Vork 0
Bestanden Kwesties 0 Pull-aanvragen 0 Wiki

Geen omschrijving

Boom: 305e9a4c94
Aftakkingen Labels
search-heap
ZIP TAR.GZ
Jonathan E. Landrum 305e9a4c94 Save State 8 jaren geleden
.gitignore df58a5dfbc Initial commit. Adding the project to version control. 10 jaren geleden
EmptyCollectionException.java df58a5dfbc Initial commit. Adding the project to version control. 10 jaren geleden
IndexOutOfBoundsException.java 305e9a4c94 Save State 8 jaren geleden
Main.java e2b1bcff5f Saving changes 10 jaren geleden
NoSuchElementException.java df58a5dfbc Initial commit. Adding the project to version control. 10 jaren geleden
Node.java 305e9a4c94 Save State 8 jaren geleden
README.md 0960106b04 Update README.md 9 jaren geleden
SearchHeap.java 305e9a4c94 Save State 8 jaren geleden
UnknownErrorException.java 305e9a4c94 Save State 8 jaren geleden
package.bluej 305e9a4c94 Save State 8 jaren geleden

README.md

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)