public class LinkedAvlMapNode<K,V> extends Object
Constructor and Description |
---|
LinkedAvlMapNode(K theKey,
V theValue)
Creates a new instance of LinkedAvlNode, containing a given value.
|
Modifier and Type | Method and Description |
---|---|
int |
computeHeight() |
int |
getBalance() |
int |
getDepth() |
int |
getHeight() |
int |
getIndex() |
K |
getKey() |
LinkedAvlMapNode<K,V> |
getLeft() |
LinkedAvlMapNode<K,V> |
getNext() |
LinkedAvlMapNode<K,V> |
getPrevious() |
LinkedAvlMapNode<K,V> |
getRight() |
SingletonOrOrderedSet<V> |
getValue() |
boolean |
isLeaf() |
void |
setDepth(int depth) |
void |
setIndex(int index) |
void |
setLeft(LinkedAvlMapNode<K,V> left) |
void |
setNext(LinkedAvlMapNode<K,V> next) |
void |
setPrevious(LinkedAvlMapNode<K,V> previous) |
void |
setRight(LinkedAvlMapNode<K,V> right) |
String |
toString() |
public LinkedAvlMapNode(K theKey, V theValue)
theKey
- the stored key on the topmost nodetheValue
- The stored value on the topmost nodepublic void setLeft(LinkedAvlMapNode<K,V> left)
public void setRight(LinkedAvlMapNode<K,V> right)
public LinkedAvlMapNode<K,V> getNext()
public LinkedAvlMapNode<K,V> getPrevious()
public LinkedAvlMapNode<K,V> getLeft()
public LinkedAvlMapNode<K,V> getRight()
public SingletonOrOrderedSet<V> getValue()
public boolean isLeaf()
public int getDepth()
public void setDepth(int depth)
public int getHeight()
public void setNext(LinkedAvlMapNode<K,V> next)
public void setPrevious(LinkedAvlMapNode<K,V> previous)
public int computeHeight()
public int getBalance()
public int getIndex()
public void setIndex(int index)
Copyright © 2003–2020 The Apache Software Foundation. All rights reserved.