![]() |
AuD
Lecture 'Algorithmen und Datenstrukturen' (code examples)
|
Key-value pair as entry (= node data) in a search tree. More...
Public Member Functions | |
| Entry (Key key, Value value) | |
| construct node More... | |
| Key | getKey () |
| get key More... | |
| Value | getValue () |
| get value More... | |
| void | setValue (Value value) |
| set value More... | |
| String | toString () |
Key-value pair as entry (= node data) in a search tree.
Definition at line 145 of file BinarySearchTree.java.
| aud.BinarySearchTree.Entry.Entry | ( | Key | key, |
| Value | value | ||
| ) |
construct node
Definition at line 150 of file BinarySearchTree.java.
| Key aud.BinarySearchTree.Entry.getKey | ( | ) |
| Value aud.BinarySearchTree.Entry.getValue | ( | ) |
| void aud.BinarySearchTree.Entry.setValue | ( | Value | value | ) |
| String aud.BinarySearchTree.Entry.toString | ( | ) |
Definition at line 161 of file BinarySearchTree.java.