AuD
Lecture 'Algorithmen und Datenstrukturen' (code examples)
aud.RedBlackTree.RBNode Class Reference

node in a RedBlackTree More...

+ Inheritance diagram for aud.RedBlackTree.RBNode:
+ Collaboration diagram for aud.RedBlackTree.RBNode:

Public Member Functions

boolean isRed ()
 Is node red? More...
 

Protected Member Functions

String textLabel ()
 
String tikzNodeStyle ()
 

Detailed Description

node in a RedBlackTree

Definition at line 43 of file RedBlackTree.java.

Member Function Documentation

◆ isRed()

boolean aud.RedBlackTree.RBNode.isRed ( )

Is node red?

Definition at line 53 of file RedBlackTree.java.

53{ return red_; }

Referenced by aud.RedBlackTree.RBNode.tikzNodeStyle().

+ Here is the caller graph for this function:

◆ textLabel()

String aud.RedBlackTree.RBNode.textLabel ( )
protected

Definition at line 55 of file RedBlackTree.java.

55 {
56 if (red_)
57 return "["+getData().toString()+"]";
58 // return "\033[91m"+getData().toString()+"\033[0m";
59 else
60 return getData().toString();
61 }

◆ tikzNodeStyle()

String aud.RedBlackTree.RBNode.tikzNodeStyle ( )
protected

Definition at line 63 of file RedBlackTree.java.

63 {
64 return isRed() ? "[red]" : "[black]";
65 }
boolean isRed()
Is node red?

References aud.RedBlackTree.RBNode.isRed().

+ Here is the call graph for this function:

The documentation for this class was generated from the following file: