![]() |
AuD
Lecture 'Algorithmen und Datenstrukturen' (code examples)
|
Entry in a KTreeNode with reference to key and left child.
More...
Collaboration diagram for aud.KTreeNode.Entry:Public Member Functions | |
| String | toString () |
Entry in a KTreeNode with reference to key and left child.
As for BinarySearchTree, null represents the smallest possible ("leftmost") key, see KTreeNode#compareKeys.
Definition at line 54 of file KTreeNode.java.
| String aud.KTreeNode.Entry.toString | ( | ) |
Definition at line 66 of file KTreeNode.java.