A B C D E F G H I K L M N O P Q R S T V

B

BinarySearchTree<K,V> - Class in net.datastructures

Realization of a dictionary by means of a binary search tree.

BinarySearchTree() - Constructor for class net.datastructures.BinarySearchTree

Creates a BinarySearchTree with a default comparator.

BinarySearchTree(Comparator<K>) - Constructor for class net.datastructures.BinarySearchTree

Creates a BinarySearchTree with the given comparator.

BinaryTree<E> - Interface in net.datastructures

An interface for a binary tree, where each node can have zero, one, or two children.

BoundaryViolationException - Exception in net.datastructures

Signals that the boundaries of a data structure have been illegally traversed (e.g.

BoundaryViolationException(String) - Constructor for exception net.datastructures.BoundaryViolationException

BTNode<E> - Class in net.datastructures

Class implementing a node of a binary tree by storing references to an element, a parent node, a left node, and a right node.

BTNode() - Constructor for class net.datastructures.BTNode

Default constructor

BTNode(E, BTPosition<E>, BTPosition<E>, BTPosition<E>) - Constructor for class net.datastructures.BTNode

Main constructor

BTPosition<E> - Interface in net.datastructures

Interface for a node of a binary tree.