Interface LLRBNode<K,V> (3.31.9) 
  
  
  
   
  
    
  
  
    
    
    
    
  Version 3.31.9keyboard_arrow_down  
  
 
    
    
    
    
      
  
  
  
    
public   interface  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   abstract   LLRBNode<K , V >  copy ( K   key ,   V   value ,   LLRBNode . Color   color ,   LLRBNode<K , V >  left ,   LLRBNode<K , V >  right )  
  
  
  getKey() 
  
    
public   abstract   K   getKey ()  
  
    
      
        Returns  
      
        Type Description  
      
        K  
     
  
  getLeft() 
  
    
public   abstract   LLRBNode<K , V >  getLeft ()  
  
  getMax() 
  
    
public   abstract   LLRBNode<K , V >  getMax ()  
  
  getMin() 
  
    
public   abstract   LLRBNode<K , V >  getMin ()  
  
  getRight() 
  
    
public   abstract   LLRBNode<K , V >  getRight ()  
  
  getValue() 
  
    
public   abstract   V   getValue ()  
  
    
      
        Returns  
      
        Type Description  
      
        V  
     
  
  inOrderTraversal(LLRBNode.NodeVisitor<K,V> visitor) 
  
    
public   abstract   void   inOrderTraversal ( LLRBNode . NodeVisitor<K , V >  visitor )  
  
  insert(K key, V value, Comparator<K> comparator) 
  
    
public   abstract   LLRBNode<K , V >  insert ( K   key ,   V   value ,   Comparator<K>   comparator )  
  
    
      
        Parameters  
      
        Name Description  
      
        keyK  
      
        valueV  
      
        comparatorComparator <K > 
     
  
  
  isEmpty() 
  
    
public   abstract   boolean   isEmpty ()  
  
  isRed() 
  
    
public   abstract   boolean   isRed ()  
  
  remove(K key, Comparator<K> comparator) 
  
    
public   abstract   LLRBNode<K , V >  remove ( K   key ,   Comparator<K>   comparator )  
  
    
      
        Parameters  
      
        Name Description  
      
        keyK  
      
        comparatorComparator <K > 
     
  
  
  shortCircuitingInOrderTraversal(LLRBNode.ShortCircuitingNodeVisitor<K,V> visitor) 
  
    
public   abstract   boolean   shortCircuitingInOrderTraversal ( LLRBNode . ShortCircuitingNodeVisitor<K , V >  visitor )  
  
  
  shortCircuitingReverseOrderTraversal(LLRBNode.ShortCircuitingNodeVisitor<K,V> visitor) 
  
    
public   abstract   boolean   shortCircuitingReverseOrderTraversal ( LLRBNode . ShortCircuitingNodeVisitor<K , V >  visitor )  
  
  
  size() 
  
    
public   abstract   int   size ()  
  
    
      
        Returns  
      
        Type Description  
      
        int  
     
  
 
     
    
  
  
  
     
  
    
    
      
       
    
    
  
  
 
  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 2025-10-29 UTC.
 
 
  
  
  
    
      [[["Easy to understand","easyToUnderstand","thumb-up"],["Solved my problem","solvedMyProblem","thumb-up"],["Other","otherUp","thumb-up"]],[["Missing the information I need","missingTheInformationINeed","thumb-down"],["Too complicated / too many steps","tooComplicatedTooManySteps","thumb-down"],["Out of date","outOfDate","thumb-down"],["Samples / code issue","samplesCodeIssue","thumb-down"],["Other","otherDown","thumb-down"]],["Last updated 2025-10-29 UTC."],[],[]]