AuD
Lecture 'Algorithmen und Datenstrukturen' (code examples)
aud.BinarySearchTree.LowerBound Class Reference

result of findLowerBound More...

+ Collaboration diagram for aud.BinarySearchTree.LowerBound:

Protected Attributes

Node node
 the node found or null for failed search More...
 
Node parent
 node's parent (always !=null) More...
 
int cmp
 result of the last call to compareKeys More...
 

Detailed Description

result of findLowerBound

See also
BinarySearchTree
BinarySearchTree::findLowerBound
BinarySearchTree::find
BinarySearchTree::insert

Definition at line 262 of file BinarySearchTree.java.

Member Data Documentation

◆ cmp

int aud.BinarySearchTree.LowerBound.cmp
protected

result of the last call to compareKeys

Definition at line 268 of file BinarySearchTree.java.

◆ node

Node aud.BinarySearchTree.LowerBound.node
protected

the node found or null for failed search

Definition at line 264 of file BinarySearchTree.java.

◆ parent

Node aud.BinarySearchTree.LowerBound.parent
protected

node's parent (always !=null)

Definition at line 266 of file BinarySearchTree.java.


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