Uses of Class
org.jheaps.tree.DaryTreeAddressableHeap.Node
-
Packages that use DaryTreeAddressableHeap.Node Package Description org.jheaps.tree Heaps using an explicit "pointer-based" tree representation -
-
Uses of DaryTreeAddressableHeap.Node in org.jheaps.tree
Fields in org.jheaps.tree declared as DaryTreeAddressableHeap.Node Modifier and Type Field Description private DaryTreeAddressableHeap.Node[]
DaryTreeAddressableHeap. aux
Auxiliary for swapping children.(package private) DaryTreeAddressableHeap.Node[]
DaryTreeAddressableHeap.Node. children
(package private) DaryTreeAddressableHeap.Node
DaryTreeAddressableHeap.Node. parent
private DaryTreeAddressableHeap.Node
DaryTreeAddressableHeap. root
Root node of the heapMethods in org.jheaps.tree that return DaryTreeAddressableHeap.Node Modifier and Type Method Description private DaryTreeAddressableHeap.Node
DaryTreeAddressableHeap. findNode(long node)
Start at the root and traverse the tree in order to find a particular node based on its numbering on a level-order traversal of the tree.Methods in org.jheaps.tree with parameters of type DaryTreeAddressableHeap.Node Modifier and Type Method Description private void
DaryTreeAddressableHeap. fixdown(DaryTreeAddressableHeap.Node n)
private void
DaryTreeAddressableHeap. fixup(DaryTreeAddressableHeap.Node n)
private void
DaryTreeAddressableHeap. swap(DaryTreeAddressableHeap.Node a, DaryTreeAddressableHeap.Node b)
Swap two nodes
-