Class LLRBValueNode<K,V> (3.2.0)
Stay organized with collections
Save and categorize content based on your preferences.
public abstract class LLRBValueNode<K,V> implements LLRBNode<K,V>
Type Parameters
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)
Parameters
Returns
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
Returns
getColor()
protected abstract LLRBNode.Color getColor()
Returns
getKey()
Returns
getLeft()
public LLRBNode<K,V> getLeft()
Returns
getMax()
public LLRBNode<K,V> getMax()
Returns
getMin()
public LLRBNode<K,V> getMin()
Returns
getRight()
public LLRBNode<K,V> getRight()
Returns
getValue()
Returns
inOrderTraversal(LLRBNode.NodeVisitor<K,V> visitor)
public void inOrderTraversal(LLRBNode.NodeVisitor<K,V> visitor)
Parameter
insert(K key, V value, Comparator<K> comparator)
public LLRBNode<K,V> insert(K key, V value, Comparator<K> comparator)
Parameters
Returns
isEmpty()
Returns
remove(K key, Comparator<K> comparator)
public LLRBNode<K,V> remove(K key, Comparator<K> comparator)
Parameters
Returns
shortCircuitingInOrderTraversal(LLRBNode.ShortCircuitingNodeVisitor<K,V> visitor)
public boolean shortCircuitingInOrderTraversal(LLRBNode.ShortCircuitingNodeVisitor<K,V> visitor)
Parameter
Returns
shortCircuitingReverseOrderTraversal(LLRBNode.ShortCircuitingNodeVisitor<K,V> visitor)
public boolean shortCircuitingReverseOrderTraversal(LLRBNode.ShortCircuitingNodeVisitor<K,V> visitor)
Parameter
Returns
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 2024-09-20 UTC.
[{
"type": "thumb-down",
"id": "hardToUnderstand",
"label":"Hard to understand"
},{
"type": "thumb-down",
"id": "incorrectInformationOrSampleCode",
"label":"Incorrect information or sample code"
},{
"type": "thumb-down",
"id": "missingTheInformationSamplesINeed",
"label":"Missing the information/samples I need"
},{
"type": "thumb-down",
"id": "otherDown",
"label":"Other"
}]
[{
"type": "thumb-up",
"id": "easyToUnderstand",
"label":"Easy to understand"
},{
"type": "thumb-up",
"id": "solvedMyProblem",
"label":"Solved my problem"
},{
"type": "thumb-up",
"id": "otherUp",
"label":"Other"
}]
{"lastModified": "Last updated 2024-09-20 UTC."}
[[["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 2024-09-20 UTC."]]