Inicio Explorar Ayuda
Iniciar sesión
jonlandrum
/
search-heap
Seguir 1
Destacar 0
Fork 0
Archivos Incidencias 0 Pull Requests 0 Wiki

Sin descripción

Rama: master
Ramas Etiquetas
search-heap
ZIP TAR.GZ
Jonathan E. Landrum 305e9a4c94 Save State hace 8 años
.gitignore df58a5dfbc Initial commit. Adding the project to version control. hace 10 años
EmptyCollectionException.java df58a5dfbc Initial commit. Adding the project to version control. hace 10 años
IndexOutOfBoundsException.java 305e9a4c94 Save State hace 8 años
Main.java e2b1bcff5f Saving changes hace 10 años
NoSuchElementException.java df58a5dfbc Initial commit. Adding the project to version control. hace 10 años
Node.java 305e9a4c94 Save State hace 8 años
README.md 0960106b04 Update README.md hace 9 años
SearchHeap.java 305e9a4c94 Save State hace 8 años
UnknownErrorException.java 305e9a4c94 Save State hace 8 años
package.bluej 305e9a4c94 Save State hace 8 años

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)