Ana Sayfa Keşfet Yardım
Giriş Yap
jonlandrum
/
search-heap
İzle 1
Yıldızla 0
Çatalla 0
Dosyalar Sorunlar 0 Değişiklik İstekleri 0 Wiki

Açıklama Yok

Ağaç: 305e9a4c94
Dallar Biçim İmleri
search-heap
ZIP TAR.GZ
Jonathan E. Landrum 305e9a4c94 Save State 8 yıl önce
.gitignore df58a5dfbc Initial commit. Adding the project to version control. 10 yıl önce
EmptyCollectionException.java df58a5dfbc Initial commit. Adding the project to version control. 10 yıl önce
IndexOutOfBoundsException.java 305e9a4c94 Save State 8 yıl önce
Main.java e2b1bcff5f Saving changes 10 yıl önce
NoSuchElementException.java df58a5dfbc Initial commit. Adding the project to version control. 10 yıl önce
Node.java 305e9a4c94 Save State 8 yıl önce
README.md 0960106b04 Update README.md 9 yıl önce
SearchHeap.java 305e9a4c94 Save State 8 yıl önce
UnknownErrorException.java 305e9a4c94 Save State 8 yıl önce
package.bluej 305e9a4c94 Save State 8 yıl önce

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)