Send feedback
Class LLRBValueNode<K,V> (3.38.0)
Stay organized with collections
Save and categorize content based on your preferences.
3.38.0 (latest)
3.37.0
3.36.0
3.35.1
3.33.4
3.32.2
3.31.9
3.30.11
3.28.0
3.27.2
3.26.5
3.25.1
3.24.3
3.22.0
3.21.4
3.20.0
3.17.0
3.16.3
3.15.7
3.14.4
3.13.2
3.12.1
3.11.0
3.10.0
3.9.6
3.8.2
3.7.10
3.6.0
3.5.0
3.4.2
3.3.0
3.2.0
3.1.0
3.0.21
public abstract class LLRBValueNode<K , V > implements LLRBNode<K , V >
Type Parameters
Name Description
K
V
Methods
copy(K key, V value, LLRBNode.Color color, LLRBNode<K,V> left, LLRBNode<K,V> right)
public LLRBValueNode<K , V > copy ( K key , V value , LLRBNode . Color color , LLRBNode<K , V > left , LLRBNode<K , V > right )
copy(K key, V value, LLRBNode<K,V> left, LLRBNode<K,V> right)
protected abstract LLRBValueNode<K , V > copy ( K key , V value , LLRBNode<K , V > left , LLRBNode<K , V > right )
Parameters
Name Description
keyK
valueV
leftLLRBNode <K ,V >
rightLLRBNode <K ,V >
getColor()
protected abstract LLRBNode . Color getColor ()
getKey()
Returns
Type Description
K
getLeft()
public LLRBNode<K , V > getLeft ()
getMax()
public LLRBNode<K , V > getMax ()
getMin()
public LLRBNode<K , V > getMin ()
getRight()
public LLRBNode<K , V > getRight ()
getValue()
Returns
Type Description
V
inOrderTraversal(LLRBNode.NodeVisitor<K,V> visitor)
public void inOrderTraversal ( LLRBNode . NodeVisitor<K , V > visitor )
insert(K key, V value, Comparator<K> comparator)
public LLRBNode<K , V > insert ( K key , V value , Comparator<K> comparator )
Parameters
Name Description
keyK
valueV
comparatorComparator <K >
isEmpty()
remove(K key, Comparator<K> comparator)
public LLRBNode<K , V > remove ( K key , Comparator<K> comparator )
Parameters
Name Description
keyK
comparatorComparator <K >
shortCircuitingInOrderTraversal(LLRBNode.ShortCircuitingNodeVisitor<K,V> visitor)
public boolean shortCircuitingInOrderTraversal ( LLRBNode . ShortCircuitingNodeVisitor<K , V > visitor )
shortCircuitingReverseOrderTraversal(LLRBNode.ShortCircuitingNodeVisitor<K,V> visitor)
public boolean shortCircuitingReverseOrderTraversal ( LLRBNode . ShortCircuitingNodeVisitor<K , V > visitor )
Send feedback
Except as otherwise noted, the content of this page is licensed under the Creative Commons Attribution 4.0 License , and code samples are licensed under the Apache 2.0 License . For details, see the Google Developers Site Policies . Java is a registered trademark of Oracle and/or its affiliates.
Last updated 2026-03-14 UTC.
Need to tell us more?
[[["Easy to understand","easyToUnderstand","thumb-up"],["Solved my problem","solvedMyProblem","thumb-up"],["Other","otherUp","thumb-up"]],[["Hard to understand","hardToUnderstand","thumb-down"],["Incorrect information or sample code","incorrectInformationOrSampleCode","thumb-down"],["Missing the information/samples I need","missingTheInformationSamplesINeed","thumb-down"],["Other","otherDown","thumb-down"]],["Last updated 2026-03-14 UTC."],[],[]]
