Classes
class	aud.BinarySearchTree< Key extends Comparable
	Base class for a binary search tree. More...

class	aud.BinarySearchTree.Entry
	Key-value pair as entry (= node data) in a search tree. More...

class	aud.BinarySearchTree.Node
	Node in a `BinarySearchTree`. More...

class	aud.BinarySearchTree.LowerBound
	result of `findLowerBound` More...

class	aud.BinarySearchTree.Cursor
	Reference to a key-value pair in a `BinarySearchTree`. More...

class	aud.BinarySearchTree.Visitor
	visitor for traversing the tree in preorder

class	aud.BinarySearchTree.Iterator
	inorder iterator More...

class	aud.BinarySearchTree.Range
	iterable range (subsequence) More...

class	aud.BinarySearchTree.RangeIterator
	Iterator over `Range`. More...

class	aud.BinarySearchTree.Decorator
	enables decoration "by key" More...

Packages
package	aud
	AuD lecture: Data structures, algorithms, examples.

Variable Documentation

◆ head_

Node head_

protected

Definition at line 234 of file BinarySearchTree.java.