Index

A B C D E F G H I K L M N O P Q R S T V _
All Classes and Interfaces|All Packages

A

Array<Item> - Class in dsa.lab01.exercises

An array-based container.

Array<Item> - Class in dsa.lab01.solutions

An array-based container.

Array() - Constructor for class dsa.lab01.exercises.Array

Construct an empty array.

Array() - Constructor for class dsa.lab01.solutions.Array

Construct an empty array.

Array(Item...) - Constructor for class dsa.lab01.exercises.Array

Construct an array containing the given items.

Array(Item...) - Constructor for class dsa.lab01.solutions.Array

Construct an array containing the given items.

ArrayMap<Key,Value> - Class in dsa.lab04.exercises

An (unsorted) array map.

ArrayMap<Key,Value> - Class in dsa.lab04.solutions

An (unsorted) array map.

ArrayMap() - Constructor for class dsa.lab04.exercises.ArrayMap

Construct an empty array map.

ArrayMap() - Constructor for class dsa.lab04.solutions.ArrayMap

Construct an empty array map.

ArrayMap(MapItem<Key, Value>...) - Constructor for class dsa.lab04.exercises.ArrayMap

Construct an array map containing the given items.

ArrayMap(MapItem<Key, Value>...) - Constructor for class dsa.lab04.solutions.ArrayMap

Construct an array map containing the given items.

ArrayMap(Iterable<MapItem<Key, Value>>) - Constructor for class dsa.lab04.exercises.ArrayMap

Construct an array map containing the given items.

ArrayMap(Iterable<MapItem<Key, Value>>) - Constructor for class dsa.lab04.solutions.ArrayMap

Construct an array map containing the given items.

ArrayMap(Iterable<MapItem<Key, Value>>, int) - Constructor for class dsa.lab04.exercises.ArrayMap

Construct an array map containing the given items more efficiently than ArrayMap(Iterable).

ArrayMap(Iterable<MapItem<Key, Value>>, int) - Constructor for class dsa.lab04.solutions.ArrayMap

Construct an array map containing the given items more efficiently than ArrayMap(Iterable).

ArrayPriorityQueue<Priority,Item> - Class in dsa.lab09.exercises

An (unsorted) array priority queue.

ArrayPriorityQueue<Priority,Item> - Class in dsa.lab09.solutions

An (unsorted) array priority queue.

ArrayPriorityQueue() - Constructor for class dsa.lab09.exercises.ArrayPriorityQueue

Construct an empty array priority queue.

ArrayPriorityQueue() - Constructor for class dsa.lab09.solutions.ArrayPriorityQueue

Construct an empty array priority queue.

ArrayPriorityQueue(PriorityQueueItem<Priority, Item>...) - Constructor for class dsa.lab09.exercises.ArrayPriorityQueue

Construct an array priority queue containing the given items.

ArrayPriorityQueue(PriorityQueueItem<Priority, Item>...) - Constructor for class dsa.lab09.solutions.ArrayPriorityQueue

Construct an array priority queue containing the given items.

ArrayPriorityQueue(Iterable<PriorityQueueItem<Priority, Item>>) - Constructor for class dsa.lab09.exercises.ArrayPriorityQueue

Construct an array priority queue containing the given items.

ArrayPriorityQueue(Iterable<PriorityQueueItem<Priority, Item>>) - Constructor for class dsa.lab09.solutions.ArrayPriorityQueue

Construct an array priority queue containing the given items.

ArrayPriorityQueue(Iterable<PriorityQueueItem<Priority, Item>>, int) - Constructor for class dsa.lab09.exercises.ArrayPriorityQueue

Construct an array priority queue containing the given items more efficiently than ArrayPriorityQueue(Iterable).

ArrayPriorityQueue(Iterable<PriorityQueueItem<Priority, Item>>, int) - Constructor for class dsa.lab09.solutions.ArrayPriorityQueue

Construct an array priority queue containing the given items more efficiently than ArrayPriorityQueue(Iterable).

ArrayQueue<Item> - Class in dsa.lab03.exercises

An array queue.

ArrayQueue<Item> - Class in dsa.lab03.solutions

An array queue.

ArrayQueue() - Constructor for class dsa.lab03.exercises.ArrayQueue

Construct an empty array queue.

ArrayQueue() - Constructor for class dsa.lab03.solutions.ArrayQueue

Construct an empty array queue.

ArrayQueue(Item...) - Constructor for class dsa.lab03.exercises.ArrayQueue

Construct an array queue containing the given items.

ArrayQueue(Item...) - Constructor for class dsa.lab03.solutions.ArrayQueue

Construct an array queue containing the given items.

ArrayQueue(Iterable<Item>) - Constructor for class dsa.lab03.exercises.ArrayQueue

Construct an array queue containing the given items.

ArrayQueue(Iterable<Item>) - Constructor for class dsa.lab03.solutions.ArrayQueue

Construct an array queue containing the given items.

ArrayQueue(Iterable<Item>, int) - Constructor for class dsa.lab03.exercises.ArrayQueue

Construct an array queue containing the given items more efficiently than ArrayQueue(Iterable).

ArrayQueue(Iterable<Item>, int) - Constructor for class dsa.lab03.solutions.ArrayQueue

Construct an array queue containing the given items more efficiently than ArrayQueue(Iterable).

ArrayStack<Item> - Class in dsa.lab03.exercises

An array stack.

ArrayStack<Item> - Class in dsa.lab03.solutions

An array stack.

ArrayStack() - Constructor for class dsa.lab03.exercises.ArrayStack

Construct an empty array stack.

ArrayStack() - Constructor for class dsa.lab03.solutions.ArrayStack

Construct an empty array stack.

ArrayStack(Item...) - Constructor for class dsa.lab03.exercises.ArrayStack

Construct an array stack containing the given items.

ArrayStack(Item...) - Constructor for class dsa.lab03.solutions.ArrayStack

Construct an array stack containing the given items.

ArrayStack(Iterable<Item>) - Constructor for class dsa.lab03.exercises.ArrayStack

Construct an array stack containing the given items.

ArrayStack(Iterable<Item>) - Constructor for class dsa.lab03.solutions.ArrayStack

Construct an array stack containing the given items.

ArrayStack(Iterable<Item>, int) - Constructor for class dsa.lab03.exercises.ArrayStack

Construct an array stack containing the given items more efficiently than ArrayStack(Iterable).

ArrayStack(Iterable<Item>, int) - Constructor for class dsa.lab03.solutions.ArrayStack

Construct an array stack containing the given items more efficiently than ArrayStack(Iterable).

ArrayUtils - Class in dsa.lib.utils

AVLTree<Key,Value> - Class in dsa.lab08.exercises

An AVL tree.

AVLTree<Key,Value> - Class in dsa.lab08.solutions

An AVL tree.

AVLTree() - Constructor for class dsa.lab08.exercises.AVLTree

Construct an empty AVL tree.

AVLTree() - Constructor for class dsa.lab08.solutions.AVLTree

Construct an empty AVL tree.

AVLTree(MapItem<Key, Value>...) - Constructor for class dsa.lab08.exercises.AVLTree

Construct an AVL tree containing the given items.

AVLTree(MapItem<Key, Value>...) - Constructor for class dsa.lab08.solutions.AVLTree

Construct an AVL tree containing the given items.

AVLTree(Iterable<MapItem<Key, Value>>) - Constructor for class dsa.lab08.exercises.AVLTree

Construct an AVL tree containing the given items.

AVLTree(Iterable<MapItem<Key, Value>>) - Constructor for class dsa.lab08.solutions.AVLTree

Construct an AVL tree containing the given items.

B

BadStaticSequence<Item> - Interface in dsa.lab01.base

A static sequence.

BinaryHeapIterator(BinaryHeapPriorityQueue<Priority, Item>) - Constructor for class dsa.lab09.exercises.BinaryHeapPriorityQueue.BinaryHeapIterator

BinaryHeapIterator(BinaryHeapPriorityQueue<Priority, Item>) - Constructor for class dsa.lab09.solutions.BinaryHeapPriorityQueue.BinaryHeapIterator

BinaryHeapPriorityQueue<Priority,Item> - Class in dsa.lab09.exercises

A binary heap priority queue.

BinaryHeapPriorityQueue<Priority,Item> - Class in dsa.lab09.solutions

A binary heap priority queue.

BinaryHeapPriorityQueue() - Constructor for class dsa.lab09.exercises.BinaryHeapPriorityQueue

Construct an empty binary heap priority queue.

BinaryHeapPriorityQueue() - Constructor for class dsa.lab09.solutions.BinaryHeapPriorityQueue

Construct an empty binary heap priority queue.

BinaryHeapPriorityQueue(PriorityQueueItem<Priority, Item>...) - Constructor for class dsa.lab09.exercises.BinaryHeapPriorityQueue

Construct a binary heap priority queue containing the given items.

BinaryHeapPriorityQueue(PriorityQueueItem<Priority, Item>...) - Constructor for class dsa.lab09.solutions.BinaryHeapPriorityQueue

Construct a binary heap priority queue containing the given items.

BinaryHeapPriorityQueue(Iterable<PriorityQueueItem<Priority, Item>>) - Constructor for class dsa.lab09.exercises.BinaryHeapPriorityQueue

Construct a binary heap priority queue containing the given items.

BinaryHeapPriorityQueue(Iterable<PriorityQueueItem<Priority, Item>>) - Constructor for class dsa.lab09.solutions.BinaryHeapPriorityQueue

Construct a binary heap priority queue containing the given items.

BinaryHeapPriorityQueue(Iterable<PriorityQueueItem<Priority, Item>>, int) - Constructor for class dsa.lab09.exercises.BinaryHeapPriorityQueue

Construct a binary heap priority queue containing the given items more efficiently than BinaryHeapPriorityQueue(Iterable).

BinaryHeapPriorityQueue(Iterable<PriorityQueueItem<Priority, Item>>, int) - Constructor for class dsa.lab09.solutions.BinaryHeapPriorityQueue

Construct a binary heap priority queue containing the given items more efficiently than BinaryHeapPriorityQueue(Iterable).

BinaryHeapPriorityQueue.BinaryHeapIterator<Priority,Item> - Class in dsa.lab09.exercises

BinaryHeapPriorityQueue.BinaryHeapIterator<Priority,Item> - Class in dsa.lab09.solutions

BinaryNodeUtils - Class in dsa.lib.utils

BinarySearcher - Class in dsa.lab04.exercises

Binary search.

BinarySearcher - Class in dsa.lab04.solutions

Binary search.

BinarySearcher() - Constructor for class dsa.lab04.exercises.BinarySearcher

BinarySearcher() - Constructor for class dsa.lab04.solutions.BinarySearcher

BinarySearchTree<Key,Value> - Class in dsa.lab07.exercises

A binary search tree.

BinarySearchTree<Key,Value> - Class in dsa.lab07.solutions

A binary search tree.

BinarySearchTree() - Constructor for class dsa.lab07.exercises.BinarySearchTree

Construct an empty binary search tree.

BinarySearchTree() - Constructor for class dsa.lab07.solutions.BinarySearchTree

Construct an empty binary search tree.

BinarySearchTree(DynamicArray<MapItem<Key, Value>>) - Constructor for class dsa.lab07.exercises.BinarySearchTree

Construct a binary search tree containing the given items.

BinarySearchTree(DynamicArray<MapItem<Key, Value>>) - Constructor for class dsa.lab07.solutions.BinarySearchTree

Construct a binary search tree containing the given items.

BinarySearchTree(MapItem<Key, Value>...) - Constructor for class dsa.lab07.exercises.BinarySearchTree

Construct a binary search tree containing the given items.

BinarySearchTree(MapItem<Key, Value>...) - Constructor for class dsa.lab07.solutions.BinarySearchTree

Construct a binary search tree containing the given items.

BinarySearchTree(Iterable<MapItem<Key, Value>>) - Constructor for class dsa.lab07.exercises.BinarySearchTree

Construct a binary search tree containing the given items.

BinarySearchTree(Iterable<MapItem<Key, Value>>) - Constructor for class dsa.lab07.solutions.BinarySearchTree

Construct a binary search tree containing the given items.

BinarySearchTree(Iterable<MapItem<Key, Value>>, int) - Constructor for class dsa.lab07.exercises.BinarySearchTree

Construct a binary search tree containing the given items more efficiently than BinarySearchTree(Iterable).

BinarySearchTree(Iterable<MapItem<Key, Value>>, int) - Constructor for class dsa.lab07.solutions.BinarySearchTree

Construct a binary search tree containing the given items more efficiently than BinarySearchTree(Iterable).

BinarySearchTree.ItemIterator<Key,Value> - Class in dsa.lab07.exercises

BinarySearchTree.ItemIterator<Key,Value> - Class in dsa.lab07.solutions

BinarySearchTree.Node<Key,Value> - Class in dsa.lab07.exercises

A node in a binary search tree.

BinarySearchTree.Node<Key,Value> - Class in dsa.lab07.solutions

A node in a binary search tree.

BinaryTree<Item> - Class in dsa.lab06.exercises

A binary tree.

BinaryTree<Item> - Class in dsa.lab06.solutions

A binary tree.

BinaryTree() - Constructor for class dsa.lab06.exercises.BinaryTree

Construct an empty binary tree.

BinaryTree() - Constructor for class dsa.lab06.solutions.BinaryTree

Construct an empty binary tree.

BinaryTree(Item...) - Constructor for class dsa.lab06.exercises.BinaryTree

Construct a binary tree containing the given items.

BinaryTree(Item...) - Constructor for class dsa.lab06.solutions.BinaryTree

Construct a binary tree containing the given items.

BinaryTree(Iterable<Item>) - Constructor for class dsa.lab06.exercises.BinaryTree

Construct a binary tree containing the given items.

BinaryTree(Iterable<Item>) - Constructor for class dsa.lab06.solutions.BinaryTree

Construct a binary tree containing the given items.

BinaryTree(Iterable<Item>, int) - Constructor for class dsa.lab06.exercises.BinaryTree

Construct a binary tree containing the given items more efficiently than BinaryTree(Iterable).

BinaryTree(Iterable<Item>, int) - Constructor for class dsa.lab06.solutions.BinaryTree

Construct a binary tree containing the given items more efficiently than BinaryTree(Iterable).

BinaryTree.IterationOrder - Enum Class in dsa.lab06.exercises

BinaryTree.IterationOrder - Enum Class in dsa.lab06.solutions

BinaryTree.Node<Item> - Class in dsa.lab06.exercises

A node in a binary tree.

BinaryTree.Node<Item> - Class in dsa.lab06.solutions

A node in a binary tree.

BinaryTree.NodeIterator<Item> - Class in dsa.lab06.exercises

BinaryTree.NodeIterator<Item> - Class in dsa.lab06.solutions

BinaryTreeUtils - Class in dsa.lib.utils

buildInOrder(Item...) - Static method in class dsa.lab06.exercises.BinaryTree

Construct a binary tree containing the given items.

buildInOrder(Item...) - Static method in class dsa.lab06.solutions.BinaryTree

Construct a binary tree containing the given items.

buildInOrder(Iterable<Item>) - Static method in class dsa.lab06.exercises.BinaryTree

Construct a binary tree containing the given items.

buildInOrder(Iterable<Item>) - Static method in class dsa.lab06.solutions.BinaryTree

Construct a binary tree containing the given items.

buildInOrder(Iterable<Item>, int) - Static method in class dsa.lab06.exercises.BinaryTree

Construct a binary tree containing the given items more efficiently than BinaryTree.buildInOrder(Iterable).

buildInOrder(Iterable<Item>, int) - Static method in class dsa.lab06.solutions.BinaryTree

Construct a binary tree containing the given items more efficiently than BinaryTree.buildInOrder(Iterable).

C

capacity() - Method in class dsa.lab03.exercises.CircularDynamicArray

Get the maximum number of items that can be contained without reallocation.

capacity() - Method in class dsa.lab03.exercises.DynamicArray

Get the maximum number of items that can be contained without reallocation.

capacity() - Method in class dsa.lab03.solutions.CircularDynamicArray

Get the maximum number of items that can be contained without reallocation.

capacity() - Method in class dsa.lab03.solutions.DynamicArray

Get the maximum number of items that can be contained without reallocation.

chain(Item[]...) - Static method in class dsa.lib.utils.ArrayUtils

chain(Class<?>, Item[]...) - Static method in class dsa.lib.utils.ArrayUtils

chain(IntFunction<Item[]>, Item[]...) - Static method in class dsa.lib.utils.ArrayUtils

ChainingHashMap<Key,Value> - Class in dsa.lab05.exercises

A chaining hash map.

ChainingHashMap<Key,Value> - Class in dsa.lab05.solutions

A chaining hash map.

ChainingHashMap() - Constructor for class dsa.lab05.exercises.ChainingHashMap

Construct an empty chaining hash map.

ChainingHashMap() - Constructor for class dsa.lab05.solutions.ChainingHashMap

Construct an empty chaining hash map.

ChainingHashMap(MapItem<Key, Value>...) - Constructor for class dsa.lab05.exercises.ChainingHashMap

Construct a chaining hash map containing the given items.

ChainingHashMap(MapItem<Key, Value>...) - Constructor for class dsa.lab05.solutions.ChainingHashMap

Construct a chaining hash map containing the given items.

ChainingHashMap(Iterable<MapItem<Key, Value>>) - Constructor for class dsa.lab05.exercises.ChainingHashMap

Construct a chaining hash map containing the given items.

ChainingHashMap(Iterable<MapItem<Key, Value>>) - Constructor for class dsa.lab05.solutions.ChainingHashMap

Construct a chaining hash map containing the given items.

ChainingHashMap(Iterable<MapItem<Key, Value>>, int) - Constructor for class dsa.lab05.exercises.ChainingHashMap

Construct a chaining hash map containing the given items more efficiently than ChainingHashMap(Iterable).

ChainingHashMap(Iterable<MapItem<Key, Value>>, int) - Constructor for class dsa.lab05.solutions.ChainingHashMap

Construct a chaining hash map containing the given items more efficiently than ChainingHashMap(Iterable).

CircularDynamicArray<Item> - Class in dsa.lab03.exercises

A circular dynamic array.

CircularDynamicArray<Item> - Class in dsa.lab03.solutions

A circular dynamic array.

CircularDynamicArray() - Constructor for class dsa.lab03.exercises.CircularDynamicArray

Construct an empty circular dynamic array.

CircularDynamicArray() - Constructor for class dsa.lab03.solutions.CircularDynamicArray

Construct an empty circular dynamic array.

CircularDynamicArray(Item...) - Constructor for class dsa.lab03.exercises.CircularDynamicArray

Construct a circular dynamic array containing the given items.

CircularDynamicArray(Item...) - Constructor for class dsa.lab03.solutions.CircularDynamicArray

Construct a circular dynamic array containing the given items.

CircularDynamicArray(Iterable<Item>) - Constructor for class dsa.lab03.exercises.CircularDynamicArray

Construct a circular dynamic array containing the given items.

CircularDynamicArray(Iterable<Item>) - Constructor for class dsa.lab03.solutions.CircularDynamicArray

Construct a circular dynamic array containing the given items.

CircularDynamicArray(Iterable<Item>, int) - Constructor for class dsa.lab03.exercises.CircularDynamicArray

Construct a circular dynamic array containing the given items more efficiently than CircularDynamicArray(Iterable).

CircularDynamicArray(Iterable<Item>, int) - Constructor for class dsa.lab03.solutions.CircularDynamicArray

Construct a circular dynamic array containing the given items more efficiently than CircularDynamicArray(Iterable).

ClassUtils - Class in dsa.lib.utils

compareTo(PriorityQueueItem<Priority, Item>) - Method in class dsa.lab09.base.PriorityQueueItem

Container<Item> - Interface in dsa.lab01.base

A container.

Container<Item> - Interface in dsa.lab02.base

A container.

contains(Item) - Method in interface dsa.lab01.base.BadStaticSequence

Check if the given item is equal to any of those contained.

contains(Item) - Method in interface dsa.lab01.base.Container

Check if the given item is equal to any of those contained.

contains(Item) - Method in class dsa.lab01.exercises.Array

contains(Item) - Method in class dsa.lab01.solutions.Array

contains(Item) - Method in interface dsa.lab02.base.Container

Check if the given item is equal to any of those contained.

contains(String) - Method in interface dsa.lab01.base.StringContainer

Check if the given string is equal to any of those contained.

contains(String) - Method in class dsa.lab01.exercises.StringArray

contains(String) - Method in class dsa.lab01.solutions.StringArray

containsKey(Key) - Method in interface dsa.lab04.base.Map

Check if the given key is equal to any of those contained.

containsValue(Value) - Method in interface dsa.lab04.base.Map

Check if the given value is equal to any of those contained.

copy(int, Item[], int, Item[]) - Static method in class dsa.lib.utils.ArrayUtils

copy(int, Item[], int, Item[], int) - Static method in class dsa.lib.utils.ArrayUtils

copy(int, Item[], Item[]) - Static method in class dsa.lib.utils.ArrayUtils

copy(int, Item[], Item[], int) - Static method in class dsa.lib.utils.ArrayUtils

copy(Item[]) - Static method in class dsa.lib.utils.ArrayUtils

copy(Item[], int, Item[]) - Static method in class dsa.lib.utils.ArrayUtils

copy(Item[], int, Item[], int) - Static method in class dsa.lib.utils.ArrayUtils

copy(Item[], Item[]) - Static method in class dsa.lib.utils.ArrayUtils

copy(Item[], Item[], int) - Static method in class dsa.lib.utils.ArrayUtils

copy(Class<?>, Item[]) - Static method in class dsa.lib.utils.ArrayUtils

copy(IntFunction<Item[]>, Item[]) - Static method in class dsa.lib.utils.ArrayUtils

D

dequeue() - Method in interface dsa.lab03.base.Queue

Dequeue (remove and return) the given item from the front.

dequeue() - Method in class dsa.lab03.exercises.ArrayQueue

dequeue() - Method in class dsa.lab03.exercises.LinkedQueue

dequeue() - Method in class dsa.lab03.solutions.ArrayQueue

dequeue() - Method in class dsa.lab03.solutions.LinkedQueue

DoublyLinkedList<Item> - Class in dsa.lab02.exercises

A doubly-linked list.

DoublyLinkedList<Item> - Class in dsa.lab02.solutions

A doubly-linked list.

DoublyLinkedList() - Constructor for class dsa.lab02.exercises.DoublyLinkedList

Construct an empty doubly-linked list.

DoublyLinkedList() - Constructor for class dsa.lab02.solutions.DoublyLinkedList

Construct an empty doubly-linked list.

DoublyLinkedList(Item...) - Constructor for class dsa.lab02.exercises.DoublyLinkedList

Construct a doubly-linked list containing the given items.

DoublyLinkedList(Item...) - Constructor for class dsa.lab02.solutions.DoublyLinkedList

Construct a doubly-linked list containing the given items.

DoublyLinkedList(Iterable<Item>) - Constructor for class dsa.lab02.exercises.DoublyLinkedList

Construct a doubly-linked list containing the given items.

DoublyLinkedList(Iterable<Item>) - Constructor for class dsa.lab02.solutions.DoublyLinkedList

Construct a doubly-linked list containing the given items.

DoublyLinkedList.Node<Item> - Class in dsa.lab02.exercises

A node in a doubly-linked list.

DoublyLinkedList.Node<Item> - Class in dsa.lab02.solutions

A node in a doubly-linked list.

dsa - package dsa

The Data Structures and Algorithms Labs.

dsa.lab01 - package dsa.lab01

Lab 1.

dsa.lab01.base - package dsa.lab01.base

Base files for lab 1.

dsa.lab01.exercises - package dsa.lab01.exercises

Exercise files for lab 1.

dsa.lab01.solutions - package dsa.lab01.solutions

Solution files for lab 1.

dsa.lab02 - package dsa.lab02

Lab 2.

dsa.lab02.base - package dsa.lab02.base

Base files for lab 2.

dsa.lab02.exercises - package dsa.lab02.exercises

Exercise files for lab 2.

dsa.lab02.solutions - package dsa.lab02.solutions

Solution files for lab 2.

dsa.lab03 - package dsa.lab03

Lab 3.

dsa.lab03.base - package dsa.lab03.base

Base files for lab 3.

dsa.lab03.exercises - package dsa.lab03.exercises

Exercise files for lab 3.

dsa.lab03.solutions - package dsa.lab03.solutions

Solution files for lab 3.

dsa.lab04 - package dsa.lab04

Lab 4.

dsa.lab04.base - package dsa.lab04.base

Base files for lab 4.

dsa.lab04.exercises - package dsa.lab04.exercises

Exercise files for lab 4.

dsa.lab04.solutions - package dsa.lab04.solutions

Solution files for lab 4.

dsa.lab05 - package dsa.lab05

Lab 5.

dsa.lab05.base - package dsa.lab05.base

Base files for lab 5.

dsa.lab05.exercises - package dsa.lab05.exercises

Exercise files for lab 5.

dsa.lab05.solutions - package dsa.lab05.solutions

Solution files for lab 5.

dsa.lab06 - package dsa.lab06

Lab 6.

dsa.lab06.exercises - package dsa.lab06.exercises

Exercise files for lab 6.

dsa.lab06.solutions - package dsa.lab06.solutions

Solution files for lab 6.

dsa.lab07 - package dsa.lab07

Lab 7.

dsa.lab07.exercises - package dsa.lab07.exercises

Exercise files for lab 7.

dsa.lab07.solutions - package dsa.lab07.solutions

Solution files for lab 7.

dsa.lab08 - package dsa.lab08

Lab 8.

dsa.lab08.exercises - package dsa.lab08.exercises

Exercise files for lab 8.

dsa.lab08.solutions - package dsa.lab08.solutions

Solution files for lab 8.

dsa.lab09 - package dsa.lab09

Lab 9.

dsa.lab09.base - package dsa.lab09.base

Base files for lab 9.

dsa.lab09.exercises - package dsa.lab09.exercises

Exercise files for lab 9.

dsa.lab09.solutions - package dsa.lab09.solutions

Solution files for lab 9.

dsa.lib.utils - package dsa.lib.utils

DynamicArray<Item> - Class in dsa.lab03.exercises

A dynamic array.

DynamicArray<Item> - Class in dsa.lab03.solutions

A dynamic array.

DynamicArray() - Constructor for class dsa.lab03.exercises.DynamicArray

Construct an empty dynamic array.

DynamicArray() - Constructor for class dsa.lab03.solutions.DynamicArray

Construct an empty dynamic array.

DynamicArray(Item...) - Constructor for class dsa.lab03.exercises.DynamicArray

Construct a dynamic array containing the given items.

DynamicArray(Item...) - Constructor for class dsa.lab03.solutions.DynamicArray

Construct a dynamic array containing the given items.

DynamicArray(Iterable<Item>) - Constructor for class dsa.lab03.exercises.DynamicArray

Construct a dynamic array containing the given items.

DynamicArray(Iterable<Item>) - Constructor for class dsa.lab03.solutions.DynamicArray

Construct a dynamic array containing the given items.

DynamicArray(Iterable<Item>, int) - Constructor for class dsa.lab03.exercises.DynamicArray

Construct a dynamic array containing the given items more efficiently than DynamicArray(Iterable).

DynamicArray(Iterable<Item>, int) - Constructor for class dsa.lab03.solutions.DynamicArray

Construct a dynamic array containing the given items more efficiently than DynamicArray(Iterable).

DynamicSequence<Item> - Interface in dsa.lab02.base

A dynamic sequence.

E

empty() - Static method in class dsa.lib.utils.ArrayUtils

empty(Class<?>) - Static method in class dsa.lib.utils.ArrayUtils

empty(IntFunction<Item[]>) - Static method in class dsa.lib.utils.ArrayUtils

enqueue(Item) - Method in interface dsa.lab03.base.Queue

Enqueue (insert) the given item to the back.

enqueue(Item) - Method in class dsa.lab03.exercises.ArrayQueue

enqueue(Item) - Method in class dsa.lab03.exercises.LinkedQueue

enqueue(Item) - Method in class dsa.lab03.solutions.ArrayQueue

enqueue(Item) - Method in class dsa.lab03.solutions.LinkedQueue

equals(Object) - Method in class dsa.lab04.base.MapItem

equals(Object) - Method in class dsa.lab09.base.PriorityQueueItem

F

field(Object, String) - Static method in class dsa.lib.utils.ClassUtils

find(Key) - Method in interface dsa.lab04.base.Map

Find the item with the given key.

find(Key) - Method in class dsa.lab04.exercises.ArrayMap

find(Key) - Method in class dsa.lab04.solutions.ArrayMap

find(Key) - Method in class dsa.lab05.exercises.ChainingHashMap

find(Key) - Method in class dsa.lab05.exercises.SortedArrayMap

find(Key) - Method in class dsa.lab05.solutions.ChainingHashMap

find(Key) - Method in class dsa.lab05.solutions.SortedArrayMap

find(Key) - Method in class dsa.lab06.exercises.ProbingHashMap

find(Key) - Method in class dsa.lab06.solutions.ProbingHashMap

find(Key) - Method in class dsa.lab07.exercises.BinarySearchTree

find(Key) - Method in class dsa.lab07.solutions.BinarySearchTree

findNode(Key) - Method in class dsa.lab07.exercises.BinarySearchTree

Find the node containing the item with the given key.

findNode(Key) - Method in class dsa.lab07.exercises.BinarySearchTree.Node

Find the node containing the item with the given key within this subtree.

findNode(Key) - Method in class dsa.lab07.solutions.BinarySearchTree

Find the node containing the item with the given key.

findNode(Key) - Method in class dsa.lab07.solutions.BinarySearchTree.Node

Find the node containing the item with the given key within this subtree.

first() - Method in interface dsa.lab02.base.StaticSequence

Get the first item.

firstNode() - Method in interface dsa.lab02.base.LinkedList

Get the first node, or null if empty.

ForwardIterator(StaticSequence<Item>) - Constructor for class dsa.lab02.base.StaticSequence.ForwardIterator

Construct a forward iterator over the items in the given sequence.

ForwardNodeIterator(LinkedList<Item>) - Constructor for class dsa.lab02.base.LinkedList.ForwardNodeIterator

Construct a forward iterator over the nodes in the given linked list.

from(int, IntFunction<Item>) - Static method in class dsa.lib.utils.ArrayUtils

from(Class<?>, int, IntFunction<Item>) - Static method in class dsa.lib.utils.ArrayUtils

from(Class<?>, Iterable<Item>) - Static method in class dsa.lib.utils.ArrayUtils

from(Class<?>, Collection<Item>) - Static method in class dsa.lib.utils.ArrayUtils

from(Class<?>, Iterator<Item>) - Static method in class dsa.lib.utils.ArrayUtils

from(Class<?>, Stream<Item>) - Static method in class dsa.lib.utils.ArrayUtils

from(Iterable<Item>) - Static method in class dsa.lib.utils.ArrayUtils

from(Collection<Item>) - Static method in class dsa.lib.utils.ArrayUtils

from(IntFunction<Item[]>, int, IntFunction<Item>) - Static method in class dsa.lib.utils.ArrayUtils

from(IntFunction<Item[]>, Iterable<Item>) - Static method in class dsa.lib.utils.ArrayUtils

from(IntFunction<Item[]>, Collection<Item>) - Static method in class dsa.lib.utils.ArrayUtils

from(IntFunction<Item[]>, Iterator<Item>) - Static method in class dsa.lib.utils.ArrayUtils

from(IntFunction<Item[]>, Stream<Item>) - Static method in class dsa.lib.utils.ArrayUtils

from(Iterator<Item>) - Static method in class dsa.lib.utils.ArrayUtils

from(Stream<Item>) - Static method in class dsa.lib.utils.ArrayUtils

front() - Method in interface dsa.lab03.base.Queue

Get the item at the front.

front() - Method in class dsa.lab03.exercises.ArrayQueue

front() - Method in class dsa.lab03.exercises.LinkedQueue

front() - Method in class dsa.lab03.solutions.ArrayQueue

front() - Method in class dsa.lab03.solutions.LinkedQueue

G

get(int) - Method in interface dsa.lab01.base.BadStaticSequence

Get the item at the given index.

get(int) - Method in interface dsa.lab01.base.StaticSequence

Get the item at the given index.

get(int) - Method in interface dsa.lab02.base.LinkedList

get(int) - Method in interface dsa.lab02.base.StaticSequence

Get the item at the given index.

get(int) - Method in class dsa.lab02.exercises.StaticArray

get(int) - Method in class dsa.lab02.solutions.StaticArray

get(int) - Method in class dsa.lab03.exercises.CircularDynamicArray

get(int) - Method in class dsa.lab03.exercises.DynamicArray

get(int) - Method in class dsa.lab03.solutions.CircularDynamicArray

get(int) - Method in class dsa.lab03.solutions.DynamicArray

get(Key) - Method in interface dsa.lab04.base.Map

Get the value associated with the given key.

H

hash(Object) - Method in class dsa.lab05.exercises.HashFunction

Hash the given object to a non-negative int less than HashFunction.size().

hash(Object) - Method in class dsa.lab05.solutions.HashFunction

Hash the given object to a non-negative int less than HashFunction.size().

hashCode() - Method in class dsa.lab04.base.MapItem

hashCode() - Method in class dsa.lab09.base.PriorityQueueItem

HashFunction - Class in dsa.lab05.exercises

A randomly-chosen hash function from a universal family.

HashFunction - Class in dsa.lab05.solutions

A randomly-chosen hash function from a universal family.

HashFunction(int) - Constructor for class dsa.lab05.exercises.HashFunction

Construct a hash function, randomly choosing its parameters.

HashFunction(int) - Constructor for class dsa.lab05.solutions.HashFunction

Construct a hash function, randomly choosing its parameters.

hasLeft() - Method in class dsa.lab06.exercises.BinaryTree.Node

Check if it has a left child.

hasLeft() - Method in class dsa.lab06.solutions.BinaryTree.Node

Check if it has a left child.

hasNext() - Method in class dsa.lab02.base.LinkedList.NodeIterator

hasNext() - Method in interface dsa.lab02.base.LinkedNode

Check if it has a next node.

hasNext() - Method in class dsa.lab02.base.StaticSequence.ForwardIterator

hasNext() - Method in class dsa.lab02.base.StaticSequence.ReverseIterator

hasNext() - Method in class dsa.lab06.exercises.BinaryTree.NodeIterator

hasNext() - Method in class dsa.lab06.solutions.BinaryTree.NodeIterator

hasNext() - Method in class dsa.lab07.exercises.BinarySearchTree.ItemIterator

hasNext() - Method in class dsa.lab07.solutions.BinarySearchTree.ItemIterator

hasNext() - Method in class dsa.lab09.base.PriorityQueue.ItemIterator

Check if there are more items to be iterated over.

hasNext() - Method in class dsa.lab09.exercises.BinaryHeapPriorityQueue.BinaryHeapIterator

hasNext() - Method in class dsa.lab09.solutions.BinaryHeapPriorityQueue.BinaryHeapIterator

hasParent() - Method in class dsa.lab06.exercises.BinaryTree.Node

Check if it has a parent (i.e.

hasParent() - Method in class dsa.lab06.solutions.BinaryTree.Node

Check if it has a parent (i.e.

hasPrevious() - Method in interface dsa.lab02.base.LinkedNode

Check if it has a previous node.

hasRight() - Method in class dsa.lab06.exercises.BinaryTree.Node

Check if it has a right child.

hasRight() - Method in class dsa.lab06.solutions.BinaryTree.Node

Check if it has a right child.

HeapSorter - Class in dsa.lab09.exercises

Heap sort.

HeapSorter - Class in dsa.lab09.solutions

Heap sort.

HeapSorter() - Constructor for class dsa.lab09.exercises.HeapSorter

HeapSorter() - Constructor for class dsa.lab09.solutions.HeapSorter

height() - Method in class dsa.lab06.exercises.BinaryTree

Get the number of levels below the root of the tree.

height() - Method in class dsa.lab06.exercises.BinaryTree.Node

Get the number of levels below.

height() - Method in class dsa.lab06.solutions.BinaryTree

Get the number of levels below the root of the tree.

height() - Method in class dsa.lab06.solutions.BinaryTree.Node

Get the number of levels below.

I

id(Object) - Static method in class dsa.lib.utils.ObjectUtils

IN - Enum constant in enum class dsa.lab06.exercises.BinaryTree.IterationOrder

IN - Enum constant in enum class dsa.lab06.solutions.BinaryTree.IterationOrder

inOrder() - Method in class dsa.lab06.exercises.BinaryTree

inOrder() - Method in class dsa.lab06.solutions.BinaryTree

inOrderNodes() - Method in class dsa.lab06.exercises.BinaryTree

inOrderNodes() - Method in class dsa.lab06.solutions.BinaryTree

insert(int, Item) - Method in interface dsa.lab02.base.DynamicSequence

Insert the given item at the given index.

insert(int, Item) - Method in class dsa.lab02.exercises.DoublyLinkedList

insert(int, Item) - Method in class dsa.lab02.exercises.SinglyLinkedList

insert(int, Item) - Method in class dsa.lab02.exercises.StaticArray

insert(int, Item) - Method in class dsa.lab02.solutions.DoublyLinkedList

insert(int, Item) - Method in class dsa.lab02.solutions.SinglyLinkedList

insert(int, Item) - Method in class dsa.lab02.solutions.StaticArray

insert(int, Item) - Method in class dsa.lab03.exercises.CircularDynamicArray

insert(int, Item) - Method in class dsa.lab03.exercises.DynamicArray

insert(int, Item) - Method in class dsa.lab03.solutions.CircularDynamicArray

insert(int, Item) - Method in class dsa.lab03.solutions.DynamicArray

insert(MapItem<Key, Value>) - Method in interface dsa.lab04.base.Map

Insert the given item.

insert(MapItem<Key, Value>) - Method in class dsa.lab04.exercises.ArrayMap

insert(MapItem<Key, Value>) - Method in class dsa.lab04.solutions.ArrayMap

insert(MapItem<Key, Value>) - Method in class dsa.lab05.exercises.ChainingHashMap

insert(MapItem<Key, Value>) - Method in class dsa.lab05.exercises.SortedArrayMap

insert(MapItem<Key, Value>) - Method in class dsa.lab05.solutions.ChainingHashMap

insert(MapItem<Key, Value>) - Method in class dsa.lab05.solutions.SortedArrayMap

insert(MapItem<Key, Value>) - Method in class dsa.lab06.exercises.ProbingHashMap

insert(MapItem<Key, Value>) - Method in class dsa.lab06.solutions.ProbingHashMap

insert(MapItem<Key, Value>) - Method in class dsa.lab07.exercises.BinarySearchTree

insert(MapItem<Key, Value>) - Method in class dsa.lab07.exercises.BinarySearchTree.Node

Insert the given item within this subtree.

insert(MapItem<Key, Value>) - Method in class dsa.lab07.solutions.BinarySearchTree

insert(MapItem<Key, Value>) - Method in class dsa.lab07.solutions.BinarySearchTree.Node

Insert the given item within this subtree.

insert(MapItem<Key, Value>) - Method in class dsa.lab08.exercises.AVLTree

insert(MapItem<Key, Value>) - Method in class dsa.lab08.solutions.AVLTree

insert(PriorityQueueItem<Priority, Item>) - Method in interface dsa.lab09.base.PriorityQueue

Insert the given prioritised item.

insert(PriorityQueueItem<Priority, Item>) - Method in class dsa.lab09.exercises.ArrayPriorityQueue

insert(PriorityQueueItem<Priority, Item>) - Method in class dsa.lab09.exercises.BinaryHeapPriorityQueue

insert(PriorityQueueItem<Priority, Item>) - Method in class dsa.lab09.exercises.SortedArrayPriorityQueue

insert(PriorityQueueItem<Priority, Item>) - Method in class dsa.lab09.solutions.ArrayPriorityQueue

insert(PriorityQueueItem<Priority, Item>) - Method in class dsa.lab09.solutions.BinaryHeapPriorityQueue

insert(PriorityQueueItem<Priority, Item>) - Method in class dsa.lab09.solutions.SortedArrayPriorityQueue

insert(Key, Value) - Method in interface dsa.lab04.base.Map

Insert an item with the given key and value.

insert(Priority, Item) - Method in interface dsa.lab09.base.PriorityQueue

Insert the given prioritised item.

insertFirst(Item) - Method in interface dsa.lab02.base.DynamicSequence

Insert the given item as the first.

InsertionSorter - Class in dsa.lab04.exercises

Insertion sort.

InsertionSorter - Class in dsa.lab04.solutions

Insertion sort.

InsertionSorter() - Constructor for class dsa.lab04.exercises.InsertionSorter

InsertionSorter() - Constructor for class dsa.lab04.solutions.InsertionSorter

insertLast(Item) - Method in interface dsa.lab02.base.DynamicSequence

Insert the given item as the last.

insertLeft(BinaryTree.Node<Item>) - Method in class dsa.lab06.exercises.BinaryTree.Node

Insert the given node as the left child.

insertLeft(BinaryTree.Node<Item>) - Method in class dsa.lab06.solutions.BinaryTree.Node

Insert the given node as the left child.

insertNext(Item) - Method in interface dsa.lab02.base.LinkedNode

Insert a node containing the given item immediately after this one in the list.

insertNext(Item) - Method in class dsa.lab02.exercises.DoublyLinkedList.Node

insertNext(Item) - Method in class dsa.lab02.exercises.SinglyLinkedList.Node

insertNext(Item) - Method in class dsa.lab02.solutions.DoublyLinkedList.Node

insertNext(Item) - Method in class dsa.lab02.solutions.SinglyLinkedList.Node

insertPrevious(Item) - Method in interface dsa.lab02.base.LinkedNode

Insert a node containing the given item immediately before this one in the list.

insertPrevious(Item) - Method in class dsa.lab02.exercises.DoublyLinkedList.Node

insertPrevious(Item) - Method in class dsa.lab02.exercises.SinglyLinkedList.Node

insertPrevious(Item) - Method in class dsa.lab02.solutions.DoublyLinkedList.Node

insertPrevious(Item) - Method in class dsa.lab02.solutions.SinglyLinkedList.Node

insertRight(BinaryTree.Node<Item>) - Method in class dsa.lab06.exercises.BinaryTree.Node

Insert the given node as the right child.

insertRight(BinaryTree.Node<Item>) - Method in class dsa.lab06.solutions.BinaryTree.Node

Insert the given node as the right child.

insertRoot(BinaryTree.Node<Item>) - Method in class dsa.lab06.exercises.BinaryTree

Insert the given node as the root.

insertRoot(BinaryTree.Node<Item>) - Method in class dsa.lab06.solutions.BinaryTree

Insert the given node as the root.

isBoxed(Class<?>) - Static method in class dsa.lib.utils.ClassUtils

isEmpty() - Method in interface dsa.lab01.base.BadStaticSequence

Check if it's empty.

isEmpty() - Method in interface dsa.lab01.base.Container

Check if it's empty.

isEmpty() - Method in interface dsa.lab01.base.StringContainer

Check if it's empty.

isEmpty() - Method in interface dsa.lab02.base.Container

Check if it's empty.

isEmpty() - Method in class dsa.lab06.exercises.BinaryTree

isEmpty() - Method in class dsa.lab06.solutions.BinaryTree

isFirst() - Method in interface dsa.lab02.base.LinkedNode

Check if it's the first in the list.

isLast() - Method in interface dsa.lab02.base.LinkedNode

Check if it's the last in the list.

isLeaf() - Method in class dsa.lab06.exercises.BinaryTree.Node

Check if it is a leaf (i.e.

isLeaf() - Method in class dsa.lab06.solutions.BinaryTree.Node

Check if it is a leaf (i.e.

isLeft() - Method in class dsa.lab06.exercises.BinaryTree.Node

Check if it is a left child (i.e.

isLeft() - Method in class dsa.lab06.solutions.BinaryTree.Node

Check if it is a left child (i.e.

isRight() - Method in class dsa.lab06.exercises.BinaryTree.Node

Check if it is a right child (i.e.

isRight() - Method in class dsa.lab06.solutions.BinaryTree.Node

Check if it is a right child (i.e.

isRoot() - Method in class dsa.lab06.exercises.BinaryTree.Node

Check if it is the root (i.e.

isRoot() - Method in class dsa.lab06.solutions.BinaryTree.Node

Check if it is the root (i.e.

item - Variable in class dsa.lab07.exercises.BinarySearchTree.Node

The contained item.

item - Variable in class dsa.lab07.solutions.BinarySearchTree.Node

The contained item.

item() - Method in interface dsa.lab02.base.LinkedNode

Get the contained item.

item() - Method in class dsa.lab02.exercises.DoublyLinkedList.Node

item() - Method in class dsa.lab02.exercises.SinglyLinkedList.Node

item() - Method in class dsa.lab02.solutions.DoublyLinkedList.Node

item() - Method in class dsa.lab02.solutions.SinglyLinkedList.Node

item() - Method in class dsa.lab06.exercises.BinaryTree.Node

Get the contained item.

item() - Method in class dsa.lab06.solutions.BinaryTree.Node

Get the contained item.

item() - Method in class dsa.lab09.base.PriorityQueueItem

Get the item.

ItemIterator(BinarySearchTree<Key, Value>, boolean) - Constructor for class dsa.lab07.exercises.BinarySearchTree.ItemIterator

ItemIterator(BinarySearchTree<Key, Value>, boolean) - Constructor for class dsa.lab07.solutions.BinarySearchTree.ItemIterator

ItemIterator(Iterator<PriorityQueueItem<Priority, Item>>) - Constructor for class dsa.lab09.base.PriorityQueue.ItemIterator

Construct an iterator over the items in the given prioritised item iterator.

items() - Method in interface dsa.lab02.base.Container

Get an iterable that yields each item once.

items() - Method in interface dsa.lab02.base.LinkedList

items() - Method in interface dsa.lab02.base.StaticSequence

Get a forward iterable that yields each item once.

items() - Method in class dsa.lab03.exercises.ArrayQueue

items() - Method in class dsa.lab03.exercises.ArrayStack

items() - Method in class dsa.lab03.exercises.LinkedQueue

items() - Method in class dsa.lab03.exercises.LinkedStack

items() - Method in class dsa.lab03.solutions.ArrayQueue

items() - Method in class dsa.lab03.solutions.ArrayStack

items() - Method in class dsa.lab03.solutions.LinkedQueue

items() - Method in class dsa.lab03.solutions.LinkedStack

items() - Method in class dsa.lab04.exercises.ArrayMap

items() - Method in class dsa.lab04.solutions.ArrayMap

items() - Method in interface dsa.lab05.base.OrderedMap

Get a forward iterable that yields each item once.

items() - Method in class dsa.lab05.exercises.ChainingHashMap

items() - Method in class dsa.lab05.exercises.SortedArrayMap

items() - Method in class dsa.lab05.solutions.ChainingHashMap

items() - Method in class dsa.lab05.solutions.SortedArrayMap

items() - Method in class dsa.lab06.exercises.BinaryTree

items() - Method in class dsa.lab06.exercises.ProbingHashMap

items() - Method in class dsa.lab06.solutions.BinaryTree

items() - Method in class dsa.lab06.solutions.ProbingHashMap

items() - Method in class dsa.lab07.exercises.BinarySearchTree

items() - Method in class dsa.lab07.solutions.BinarySearchTree

items() - Method in interface dsa.lab09.base.PriorityQueue

Get a forward iterable that yields each prioritised item once.

items() - Method in class dsa.lab09.exercises.ArrayPriorityQueue

items() - Method in class dsa.lab09.exercises.BinaryHeapPriorityQueue

items() - Method in class dsa.lab09.exercises.SortedArrayPriorityQueue

items() - Method in class dsa.lab09.solutions.ArrayPriorityQueue

items() - Method in class dsa.lab09.solutions.BinaryHeapPriorityQueue

items() - Method in class dsa.lab09.solutions.SortedArrayPriorityQueue

itemsOnly() - Method in interface dsa.lab09.base.PriorityQueue

Get a reverse iterable that yields each item once.

IterableUtils - Class in dsa.lib.utils

iterator() - Method in interface dsa.lab02.base.Container

K

key() - Method in class dsa.lab04.base.MapItem

Get the key (the unique/identifying part of the item).

keys() - Method in interface dsa.lab04.base.Map

Get an iterable that yields each key once.

keys() - Method in interface dsa.lab05.base.OrderedMap

Get a forward iterable that yields each key once.

L

last() - Method in interface dsa.lab02.base.StaticSequence

Get the last item.

lastNode() - Method in interface dsa.lab02.base.LinkedList

Get the last node, or null if empty.

left - Variable in class dsa.lab07.exercises.BinarySearchTree.Node

The left child - possibly null.

left - Variable in class dsa.lab07.solutions.BinarySearchTree.Node

The left child - possibly null.

left() - Method in class dsa.lab06.exercises.BinaryTree.Node

Get the left child node.

left() - Method in class dsa.lab06.solutions.BinaryTree.Node

Get the left child node.

level() - Method in class dsa.lab06.exercises.BinaryTree.Node

Get the number of levels above.

level() - Method in class dsa.lab06.solutions.BinaryTree.Node

Get the number of levels above.

LinkedList<Item> - Interface in dsa.lab02.base

A linked list.

LinkedList.ForwardNodeIterator<Item> - Class in dsa.lab02.base

A forward iterator over the nodes in a linked list.

LinkedList.NodeIterator<Item> - Class in dsa.lab02.base

An iterator over the nodes in a linked list.

LinkedList.ReverseNodeIterator<Item> - Class in dsa.lab02.base

A reverse iterator over the nodes in a linked list.

LinkedNode<Item> - Interface in dsa.lab02.base

A node in a linked list.

LinkedQueue<Item> - Class in dsa.lab03.exercises

A linked queue.

LinkedQueue<Item> - Class in dsa.lab03.solutions

A linked queue.

LinkedQueue() - Constructor for class dsa.lab03.exercises.LinkedQueue

Construct an empty linked queue.

LinkedQueue() - Constructor for class dsa.lab03.solutions.LinkedQueue

Construct an empty linked queue.

LinkedQueue(Item...) - Constructor for class dsa.lab03.exercises.LinkedQueue

Construct a linked queue containing the given items.

LinkedQueue(Item...) - Constructor for class dsa.lab03.solutions.LinkedQueue

Construct a linked queue containing the given items.

LinkedQueue(Iterable<Item>) - Constructor for class dsa.lab03.exercises.LinkedQueue

Construct a linked queue containing the given items.

LinkedQueue(Iterable<Item>) - Constructor for class dsa.lab03.solutions.LinkedQueue

Construct a linked queue containing the given items.

LinkedStack<Item> - Class in dsa.lab03.exercises

A linked stack.

LinkedStack<Item> - Class in dsa.lab03.solutions

A linked stack.

LinkedStack() - Constructor for class dsa.lab03.exercises.LinkedStack

Construct an empty linked stack.

LinkedStack() - Constructor for class dsa.lab03.solutions.LinkedStack

Construct an empty linked stack.

LinkedStack(Item...) - Constructor for class dsa.lab03.exercises.LinkedStack

Construct a linked stack containing the given items.

LinkedStack(Item...) - Constructor for class dsa.lab03.solutions.LinkedStack

Construct a linked stack containing the given items.

LinkedStack(Iterable<Item>) - Constructor for class dsa.lab03.exercises.LinkedStack

Construct a linked stack containing the given items.

LinkedStack(Iterable<Item>) - Constructor for class dsa.lab03.solutions.LinkedStack

Construct a linked stack containing the given items.

list() - Method in interface dsa.lab02.base.LinkedNode

Get the containing list.

list() - Method in class dsa.lab02.exercises.DoublyLinkedList.Node

list() - Method in class dsa.lab02.exercises.SinglyLinkedList.Node

list() - Method in class dsa.lab02.solutions.DoublyLinkedList.Node

list() - Method in class dsa.lab02.solutions.SinglyLinkedList.Node

M

main(String[]) - Static method in class dsa.Main

Main - Class in dsa

Main() - Constructor for class dsa.Main

make(int) - Static method in class dsa.lib.utils.ArrayUtils

make(Class<?>, int) - Static method in class dsa.lib.utils.ArrayUtils

makeTyped(Class<?>) - Static method in class dsa.lib.utils.ArrayUtils

makeUntyped() - Static method in class dsa.lib.utils.ArrayUtils

Map<Key,Value> - Interface in dsa.lab04.base

A map.

MapItem<Key,Value> - Class in dsa.lab04.base

An item in a map.

MapItem(Key, Value) - Constructor for class dsa.lab04.base.MapItem

Construct a map item.

max() - Method in interface dsa.lab05.base.OrderedMap

Get the item with the greatest key.

max() - Method in class dsa.lab05.exercises.SortedArrayMap

max() - Method in class dsa.lab05.solutions.SortedArrayMap

max() - Method in class dsa.lab07.exercises.BinarySearchTree

max() - Method in class dsa.lab07.exercises.BinarySearchTree.Node

Get the item in this subtree with the greatest key.

max() - Method in class dsa.lab07.solutions.BinarySearchTree

max() - Method in class dsa.lab07.solutions.BinarySearchTree.Node

Get the item in this subtree with the greatest key.

max() - Method in interface dsa.lab09.base.PriorityQueue

Get the item with the greatest priority.

max() - Method in class dsa.lab09.exercises.ArrayPriorityQueue

max() - Method in class dsa.lab09.exercises.BinaryHeapPriorityQueue

max() - Method in class dsa.lab09.exercises.SortedArrayPriorityQueue

max() - Method in class dsa.lab09.solutions.ArrayPriorityQueue

max() - Method in class dsa.lab09.solutions.BinaryHeapPriorityQueue

max() - Method in class dsa.lab09.solutions.SortedArrayPriorityQueue

maxNode() - Method in class dsa.lab07.exercises.BinarySearchTree.Node

Get the node in this subtree with the greatest key.

maxNode() - Method in class dsa.lab07.solutions.BinarySearchTree.Node

Get the node in this subtree with the greatest key.

MergeSorter - Class in dsa.lab04.exercises

Merge sort.

MergeSorter - Class in dsa.lab04.solutions

Merge sort.

MergeSorter() - Constructor for class dsa.lab04.exercises.MergeSorter

MergeSorter() - Constructor for class dsa.lab04.solutions.MergeSorter

min() - Method in interface dsa.lab05.base.OrderedMap

Get the item with the least key.

min() - Method in class dsa.lab05.exercises.SortedArrayMap

min() - Method in class dsa.lab05.solutions.SortedArrayMap

min() - Method in class dsa.lab07.exercises.BinarySearchTree

min() - Method in class dsa.lab07.exercises.BinarySearchTree.Node

Get the item in this subtree with the least key.

min() - Method in class dsa.lab07.solutions.BinarySearchTree

min() - Method in class dsa.lab07.solutions.BinarySearchTree.Node

Get the item in this subtree with the least key.

minNode() - Method in class dsa.lab07.exercises.BinarySearchTree.Node

Get the node in this subtree with the least key.

minNode() - Method in class dsa.lab07.solutions.BinarySearchTree.Node

Get the node in this subtree with the least key.

N

next() - Method in class dsa.lab02.base.LinkedList.NodeIterator

next() - Method in interface dsa.lab02.base.LinkedNode

Get the next node.

next() - Method in class dsa.lab02.base.StaticSequence.ForwardIterator

next() - Method in class dsa.lab02.base.StaticSequence.ReverseIterator

next() - Method in class dsa.lab02.exercises.DoublyLinkedList.Node

next() - Method in class dsa.lab02.exercises.SinglyLinkedList.Node

next() - Method in class dsa.lab02.solutions.DoublyLinkedList.Node

next() - Method in class dsa.lab02.solutions.SinglyLinkedList.Node

next() - Method in class dsa.lab06.exercises.BinaryTree.NodeIterator

next() - Method in class dsa.lab06.solutions.BinaryTree.NodeIterator

next() - Method in class dsa.lab07.exercises.BinarySearchTree.ItemIterator

next() - Method in class dsa.lab07.solutions.BinarySearchTree.ItemIterator

next() - Method in class dsa.lab09.base.PriorityQueue.ItemIterator

Get the next item in the iteration.

next() - Method in class dsa.lab09.exercises.BinaryHeapPriorityQueue.BinaryHeapIterator

next() - Method in class dsa.lab09.solutions.BinaryHeapPriorityQueue.BinaryHeapIterator

next(Key) - Method in interface dsa.lab05.base.OrderedMap

Get the item that would be the successor of one with the given key.

next(Key) - Method in class dsa.lab05.exercises.SortedArrayMap

next(Key) - Method in class dsa.lab05.solutions.SortedArrayMap

next(Key) - Method in class dsa.lab07.exercises.BinarySearchTree

next(Key) - Method in class dsa.lab07.exercises.BinarySearchTree.Node

Get the item within this subtree that would be the successor of one with the given key.

next(Key) - Method in class dsa.lab07.solutions.BinarySearchTree

next(Key) - Method in class dsa.lab07.solutions.BinarySearchTree.Node

Get the item within this subtree that would be the successor of one with the given key.

nextNode(LinkedNode<Item>) - Method in class dsa.lab02.base.LinkedList.ForwardNodeIterator

nextNode(LinkedNode<Item>) - Method in class dsa.lab02.base.LinkedList.NodeIterator

nextNode(LinkedNode<Item>) - Method in class dsa.lab02.base.LinkedList.ReverseNodeIterator

node(int) - Method in interface dsa.lab02.base.LinkedList

Get the node at the given index.

node(int) - Method in class dsa.lab02.exercises.DoublyLinkedList

node(int) - Method in class dsa.lab02.exercises.SinglyLinkedList

node(int) - Method in class dsa.lab02.solutions.DoublyLinkedList

node(int) - Method in class dsa.lab02.solutions.SinglyLinkedList

Node(DoublyLinkedList<Item>, DoublyLinkedList.Node<Item>, Item) - Constructor for class dsa.lab02.exercises.DoublyLinkedList.Node

Construct a node with the given predecessor and item.

Node(DoublyLinkedList<Item>, DoublyLinkedList.Node<Item>, Item, DoublyLinkedList.Node<Item>) - Constructor for class dsa.lab02.exercises.DoublyLinkedList.Node

Construct a node with the given predecessor, item and successor.

Node(DoublyLinkedList<Item>, Item) - Constructor for class dsa.lab02.exercises.DoublyLinkedList.Node

Construct a node with the given item.

Node(DoublyLinkedList<Item>, Item, DoublyLinkedList.Node<Item>) - Constructor for class dsa.lab02.exercises.DoublyLinkedList.Node

Construct a node with the given item and successor.

Node(SinglyLinkedList<Item>, Item) - Constructor for class dsa.lab02.exercises.SinglyLinkedList.Node

Construct a node with the given item.

Node(SinglyLinkedList<Item>, Item, SinglyLinkedList.Node<Item>) - Constructor for class dsa.lab02.exercises.SinglyLinkedList.Node

Construct a node with the given item and successor.

Node(DoublyLinkedList<Item>, DoublyLinkedList.Node<Item>, Item) - Constructor for class dsa.lab02.solutions.DoublyLinkedList.Node

Construct a node with the given predecessor and item.

Node(DoublyLinkedList<Item>, DoublyLinkedList.Node<Item>, Item, DoublyLinkedList.Node<Item>) - Constructor for class dsa.lab02.solutions.DoublyLinkedList.Node

Construct a node with the given predecessor, item and successor.

Node(DoublyLinkedList<Item>, Item) - Constructor for class dsa.lab02.solutions.DoublyLinkedList.Node

Construct a node with the given item.

Node(DoublyLinkedList<Item>, Item, DoublyLinkedList.Node<Item>) - Constructor for class dsa.lab02.solutions.DoublyLinkedList.Node

Construct a node with the given item and successor.

Node(SinglyLinkedList<Item>, Item) - Constructor for class dsa.lab02.solutions.SinglyLinkedList.Node

Construct a node with the given item.

Node(SinglyLinkedList<Item>, Item, SinglyLinkedList.Node<Item>) - Constructor for class dsa.lab02.solutions.SinglyLinkedList.Node

Construct a node with the given item and successor.

Node(BinaryTree<Item>, BinaryTree.Node<Item>, Item) - Constructor for class dsa.lab06.exercises.BinaryTree.Node

Construct a binary node with no parent and only a left child.

Node(BinaryTree<Item>, BinaryTree.Node<Item>, Item, BinaryTree.Node<Item>) - Constructor for class dsa.lab06.exercises.BinaryTree.Node

Construct a binary node with no parent and both children.

Node(BinaryTree<Item>, Item) - Constructor for class dsa.lab06.exercises.BinaryTree.Node

Construct a binary node with no parent nor children.

Node(BinaryTree<Item>, Item, BinaryTree.Node<Item>) - Constructor for class dsa.lab06.exercises.BinaryTree.Node

Construct a binary node with no parent and only a right child.

Node(BinaryTree<Item>, BinaryTree.Node<Item>, Item) - Constructor for class dsa.lab06.solutions.BinaryTree.Node

Construct a binary node with no parent and only a left child.

Node(BinaryTree<Item>, BinaryTree.Node<Item>, Item, BinaryTree.Node<Item>) - Constructor for class dsa.lab06.solutions.BinaryTree.Node

Construct a binary node with no parent and both children.

Node(BinaryTree<Item>, Item) - Constructor for class dsa.lab06.solutions.BinaryTree.Node

Construct a binary node with no parent nor children.

Node(BinaryTree<Item>, Item, BinaryTree.Node<Item>) - Constructor for class dsa.lab06.solutions.BinaryTree.Node

Construct a binary node with no parent and only a right child.

Node(BinarySearchTree.Node<Key, Value>, BinarySearchTree<Key, Value>, BinarySearchTree.Node<Key, Value>, MapItem<Key, Value>, BinarySearchTree.Node<Key, Value>) - Constructor for class dsa.lab07.exercises.BinarySearchTree.Node

Node(BinarySearchTree.Node<Key, Value>, BinarySearchTree<Key, Value>, BinarySearchTree.Node<Key, Value>, MapItem<Key, Value>, BinarySearchTree.Node<Key, Value>) - Constructor for class dsa.lab07.solutions.BinarySearchTree.Node

NodeIterator(LinkedNode<Item>) - Constructor for class dsa.lab02.base.LinkedList.NodeIterator

Construct an iterator over the nodes in a linked list.

NodeIterator(BinaryTree<Item>, BinaryTree.IterationOrder) - Constructor for class dsa.lab06.exercises.BinaryTree.NodeIterator

Construct an iterator over the nodes in a binary tree.

NodeIterator(BinaryTree<Item>, BinaryTree.IterationOrder) - Constructor for class dsa.lab06.solutions.BinaryTree.NodeIterator

Construct an iterator over the nodes in a binary tree.

nodes() - Method in interface dsa.lab02.base.LinkedList

Get a forward iterable that yields each node once.

O

ObjectUtils - Class in dsa.lib.utils

OrderedMap<Key,Value> - Interface in dsa.lab05.base

An ordered map.

P

parent - Variable in class dsa.lab07.exercises.BinarySearchTree.Node

The parent node - possibly null (if root).

parent - Variable in class dsa.lab07.solutions.BinarySearchTree.Node

The parent node - possibly null (if root).

parent() - Method in class dsa.lab06.exercises.BinaryTree.Node

Get the parent node.

parent() - Method in class dsa.lab06.solutions.BinaryTree.Node

Get the parent node.

pop() - Method in interface dsa.lab03.base.Stack

Pop (remove and return) the given item from the top.

pop() - Method in class dsa.lab03.exercises.ArrayStack

pop() - Method in class dsa.lab03.exercises.LinkedStack

pop() - Method in class dsa.lab03.solutions.ArrayStack

pop() - Method in class dsa.lab03.solutions.LinkedStack

POST - Enum constant in enum class dsa.lab06.exercises.BinaryTree.IterationOrder

POST - Enum constant in enum class dsa.lab06.solutions.BinaryTree.IterationOrder

postOrder() - Method in class dsa.lab06.exercises.BinaryTree

postOrder() - Method in class dsa.lab06.solutions.BinaryTree

postOrderNodes() - Method in class dsa.lab06.exercises.BinaryTree

postOrderNodes() - Method in class dsa.lab06.solutions.BinaryTree

PRE - Enum constant in enum class dsa.lab06.exercises.BinaryTree.IterationOrder

PRE - Enum constant in enum class dsa.lab06.solutions.BinaryTree.IterationOrder

preOrder() - Method in class dsa.lab06.exercises.BinaryTree

preOrder() - Method in class dsa.lab06.solutions.BinaryTree

preOrderNodes() - Method in class dsa.lab06.exercises.BinaryTree

preOrderNodes() - Method in class dsa.lab06.solutions.BinaryTree

previous() - Method in interface dsa.lab02.base.LinkedNode

Get the previous node.

previous() - Method in class dsa.lab02.exercises.DoublyLinkedList.Node

previous() - Method in class dsa.lab02.exercises.SinglyLinkedList.Node

previous() - Method in class dsa.lab02.solutions.DoublyLinkedList.Node

previous() - Method in class dsa.lab02.solutions.SinglyLinkedList.Node

previous(Key) - Method in interface dsa.lab05.base.OrderedMap

Get the item that would be the predecessor of one with the given key.

previous(Key) - Method in class dsa.lab05.exercises.SortedArrayMap

previous(Key) - Method in class dsa.lab05.solutions.SortedArrayMap

previous(Key) - Method in class dsa.lab07.exercises.BinarySearchTree.Node

Get the item within this subtree that would be the predecessor of one with the given key.

previous(Key) - Method in class dsa.lab07.exercises.BinarySearchTree

previous(Key) - Method in class dsa.lab07.solutions.BinarySearchTree.Node

Get the item within this subtree that would be the predecessor of one with the given key.

previous(Key) - Method in class dsa.lab07.solutions.BinarySearchTree

printInOrder() - Method in class dsa.lab06.exercises.BinaryTree.Node

Print out the items in this subtree, "in-order".

printInOrder() - Method in class dsa.lab06.exercises.BinaryTree

printInOrder() - Method in class dsa.lab06.solutions.BinaryTree.Node

Print out the items in this subtree, "in-order".

printInOrder() - Method in class dsa.lab06.solutions.BinaryTree

printPostOrder() - Method in class dsa.lab06.exercises.BinaryTree.Node

Print out the items in this subtree, "post-order".

printPostOrder() - Method in class dsa.lab06.exercises.BinaryTree

printPostOrder() - Method in class dsa.lab06.solutions.BinaryTree.Node

Print out the items in this subtree, "post-order".

printPostOrder() - Method in class dsa.lab06.solutions.BinaryTree

printPreOrder() - Method in class dsa.lab06.exercises.BinaryTree.Node

Print out the items in this subtree, "pre-order".

printPreOrder() - Method in class dsa.lab06.exercises.BinaryTree

printPreOrder() - Method in class dsa.lab06.solutions.BinaryTree.Node

Print out the items in this subtree, "pre-order".

printPreOrder() - Method in class dsa.lab06.solutions.BinaryTree

priority() - Method in class dsa.lab09.base.PriorityQueueItem

Get the priority.

PriorityQueue<Priority,Item> - Interface in dsa.lab09.base

A priority queue.

PriorityQueue.ItemIterator<Priority,Item> - Class in dsa.lab09.base

An iterator over the items in a priority queue.

PriorityQueueItem<Priority,Item> - Class in dsa.lab09.base

An item in a priority queue.

PriorityQueueItem(Priority, Item) - Constructor for class dsa.lab09.base.PriorityQueueItem

Construct a priority queue item.

ProbingHashMap<Key,Value> - Class in dsa.lab06.exercises

A (linearly-)probing hash map.

ProbingHashMap<Key,Value> - Class in dsa.lab06.solutions

A (linearly-)probing hash map.

ProbingHashMap() - Constructor for class dsa.lab06.exercises.ProbingHashMap

Construct an empty probing hash map.

ProbingHashMap() - Constructor for class dsa.lab06.solutions.ProbingHashMap

Construct an empty probing hash map.

ProbingHashMap(MapItem<Key, Value>...) - Constructor for class dsa.lab06.exercises.ProbingHashMap

Construct a probing hash map containing the given items.

ProbingHashMap(MapItem<Key, Value>...) - Constructor for class dsa.lab06.solutions.ProbingHashMap

Construct a probing hash map containing the given items.

ProbingHashMap(Iterable<MapItem<Key, Value>>) - Constructor for class dsa.lab06.exercises.ProbingHashMap

Construct a probing hash map containing the given items.

ProbingHashMap(Iterable<MapItem<Key, Value>>) - Constructor for class dsa.lab06.solutions.ProbingHashMap

Construct a probing hash map containing the given items.

ProbingHashMap(Iterable<MapItem<Key, Value>>, int) - Constructor for class dsa.lab06.exercises.ProbingHashMap

Construct a probing hash map containing the given items more efficiently than ProbingHashMap(Iterable).

ProbingHashMap(Iterable<MapItem<Key, Value>>, int) - Constructor for class dsa.lab06.solutions.ProbingHashMap

Construct a probing hash map containing the given items more efficiently than ProbingHashMap(Iterable).

push(Item) - Method in interface dsa.lab03.base.Stack

Push (insert) the given item onto the top.

push(Item) - Method in class dsa.lab03.exercises.ArrayStack

push(Item) - Method in class dsa.lab03.exercises.LinkedStack

push(Item) - Method in class dsa.lab03.solutions.ArrayStack

push(Item) - Method in class dsa.lab03.solutions.LinkedStack

Q

Queue<Item> - Interface in dsa.lab03.base

A queue.

R

remove() - Method in interface dsa.lab02.base.LinkedNode

Remove the node from the list and return its item.

remove() - Method in class dsa.lab02.exercises.DoublyLinkedList.Node

remove() - Method in class dsa.lab02.exercises.SinglyLinkedList.Node

remove() - Method in class dsa.lab02.solutions.DoublyLinkedList.Node

remove() - Method in class dsa.lab02.solutions.SinglyLinkedList.Node

remove() - Method in class dsa.lab07.exercises.BinarySearchTree.Node

Remove the item that this node contains from the tree, and return the node removed.

remove() - Method in class dsa.lab07.solutions.BinarySearchTree.Node

Remove the item that this node contains from the tree, and return the node removed.

remove() - Method in class dsa.lab09.base.PriorityQueue.ItemIterator

Remove the previous item returned from PriorityQueue.ItemIterator.next().

remove(int) - Method in interface dsa.lab02.base.DynamicSequence

Remove and return the item at the given index.

remove(int) - Method in class dsa.lab02.exercises.DoublyLinkedList

remove(int) - Method in class dsa.lab02.exercises.SinglyLinkedList

remove(int) - Method in class dsa.lab02.exercises.StaticArray

remove(int) - Method in class dsa.lab02.solutions.DoublyLinkedList

remove(int) - Method in class dsa.lab02.solutions.SinglyLinkedList

remove(int) - Method in class dsa.lab02.solutions.StaticArray

remove(int) - Method in class dsa.lab03.exercises.CircularDynamicArray

remove(int) - Method in class dsa.lab03.exercises.DynamicArray

remove(int) - Method in class dsa.lab03.solutions.CircularDynamicArray

remove(int) - Method in class dsa.lab03.solutions.DynamicArray

remove(Key) - Method in interface dsa.lab04.base.Map

Remove and return the item with the given key.

remove(Key) - Method in class dsa.lab04.exercises.ArrayMap

remove(Key) - Method in class dsa.lab04.solutions.ArrayMap

remove(Key) - Method in class dsa.lab05.exercises.ChainingHashMap

remove(Key) - Method in class dsa.lab05.exercises.SortedArrayMap

remove(Key) - Method in class dsa.lab05.solutions.ChainingHashMap

remove(Key) - Method in class dsa.lab05.solutions.SortedArrayMap

remove(Key) - Method in class dsa.lab06.exercises.ProbingHashMap

remove(Key) - Method in class dsa.lab06.solutions.ProbingHashMap

remove(Key) - Method in class dsa.lab07.exercises.BinarySearchTree

remove(Key) - Method in class dsa.lab07.solutions.BinarySearchTree

remove(Key) - Method in class dsa.lab08.exercises.AVLTree

remove(Key) - Method in class dsa.lab08.solutions.AVLTree

removeFirst() - Method in interface dsa.lab02.base.DynamicSequence

Remove and return the first item.

removeLast() - Method in interface dsa.lab02.base.DynamicSequence

Remove and return the last item.

removeLeft() - Method in class dsa.lab06.exercises.BinaryTree.Node

Remove and return the left child.

removeLeft() - Method in class dsa.lab06.solutions.BinaryTree.Node

Remove and return the left child.

removeMax() - Method in interface dsa.lab09.base.PriorityQueue

Remove the item with the greatest priority.

removeMax() - Method in class dsa.lab09.exercises.ArrayPriorityQueue

removeMax() - Method in class dsa.lab09.exercises.BinaryHeapPriorityQueue

removeMax() - Method in class dsa.lab09.exercises.SortedArrayPriorityQueue

removeMax() - Method in class dsa.lab09.solutions.ArrayPriorityQueue

removeMax() - Method in class dsa.lab09.solutions.BinaryHeapPriorityQueue

removeMax() - Method in class dsa.lab09.solutions.SortedArrayPriorityQueue

removeNext() - Method in interface dsa.lab02.base.LinkedNode

Remove the next node from the list and return its item.

removeNext() - Method in class dsa.lab02.exercises.DoublyLinkedList.Node

removeNext() - Method in class dsa.lab02.exercises.SinglyLinkedList.Node

removeNext() - Method in class dsa.lab02.solutions.DoublyLinkedList.Node

removeNext() - Method in class dsa.lab02.solutions.SinglyLinkedList.Node

removePrevious() - Method in interface dsa.lab02.base.LinkedNode

Remove the previous node from the list and return its item.

removePrevious() - Method in class dsa.lab02.exercises.DoublyLinkedList.Node

removePrevious() - Method in class dsa.lab02.exercises.SinglyLinkedList.Node

removePrevious() - Method in class dsa.lab02.solutions.DoublyLinkedList.Node

removePrevious() - Method in class dsa.lab02.solutions.SinglyLinkedList.Node

removeRight() - Method in class dsa.lab06.exercises.BinaryTree.Node

Remove and return the right child.

removeRight() - Method in class dsa.lab06.solutions.BinaryTree.Node

Remove and return the right child.

removeRoot() - Method in class dsa.lab06.exercises.BinaryTree

Remove and return the root.

removeRoot() - Method in class dsa.lab06.solutions.BinaryTree

Remove and return the root.

repeat(int, Item) - Static method in class dsa.lib.utils.ArrayUtils

repeat(Class<?>, int, Item) - Static method in class dsa.lib.utils.ArrayUtils

repeat(IntFunction<Item[]>, int, Item) - Static method in class dsa.lib.utils.ArrayUtils

replace(Item[], BiFunction<Item, Integer, Result>) - Static method in class dsa.lib.utils.ArrayUtils

replace(Item[], Function<Item, Result>) - Static method in class dsa.lib.utils.ArrayUtils

replace(Class<?>, Item[], BiFunction<Item, Integer, Result>) - Static method in class dsa.lib.utils.ArrayUtils

replace(Class<?>, Item[], Function<Item, Result>) - Static method in class dsa.lib.utils.ArrayUtils

replace(IntFunction<Result[]>, Item[], BiFunction<Item, Integer, Result>) - Static method in class dsa.lib.utils.ArrayUtils

replace(IntFunction<Result[]>, Item[], Function<Item, Result>) - Static method in class dsa.lib.utils.ArrayUtils

REVERSE_IN - Enum constant in enum class dsa.lab06.exercises.BinaryTree.IterationOrder

REVERSE_IN - Enum constant in enum class dsa.lab06.solutions.BinaryTree.IterationOrder

REVERSE_POST - Enum constant in enum class dsa.lab06.exercises.BinaryTree.IterationOrder

REVERSE_POST - Enum constant in enum class dsa.lab06.solutions.BinaryTree.IterationOrder

REVERSE_PRE - Enum constant in enum class dsa.lab06.exercises.BinaryTree.IterationOrder

REVERSE_PRE - Enum constant in enum class dsa.lab06.solutions.BinaryTree.IterationOrder

reversed() - Method in interface dsa.lab02.base.LinkedList

reversed() - Method in interface dsa.lab02.base.StaticSequence

Get a reverse iterable that yields each item once.

reversed() - Method in interface dsa.lab05.base.OrderedMap

Get a reverse iterable that yields each item once.

reversed() - Method in class dsa.lab05.exercises.SortedArrayMap

reversed() - Method in class dsa.lab05.solutions.SortedArrayMap

reversed() - Method in class dsa.lab07.exercises.BinarySearchTree

reversed() - Method in class dsa.lab07.solutions.BinarySearchTree

reversed() - Method in interface dsa.lab09.base.PriorityQueue

Get a reverse iterable that yields each prioritised item once.

reversed() - Method in class dsa.lab09.exercises.ArrayPriorityQueue

reversed() - Method in class dsa.lab09.exercises.BinaryHeapPriorityQueue

reversed() - Method in class dsa.lab09.exercises.SortedArrayPriorityQueue

reversed() - Method in class dsa.lab09.solutions.ArrayPriorityQueue

reversed() - Method in class dsa.lab09.solutions.BinaryHeapPriorityQueue

reversed() - Method in class dsa.lab09.solutions.SortedArrayPriorityQueue

reversed(Item[]) - Static method in class dsa.lib.utils.ArrayUtils

reversed(Class<?>, Item[]) - Static method in class dsa.lib.utils.ArrayUtils

reversed(IntFunction<Item[]>, Item[]) - Static method in class dsa.lib.utils.ArrayUtils

reversedItemsOnly() - Method in interface dsa.lab09.base.PriorityQueue

Get a reverse iterable that yields each item once.

reversedKeys() - Method in interface dsa.lab05.base.OrderedMap

Get a reverse iterable that yields each key once.

reversedNodes() - Method in interface dsa.lab02.base.LinkedList

Get a reverse iterable that yields each node once.

reverseInOrder() - Method in class dsa.lab06.exercises.BinaryTree

reverseInOrder() - Method in class dsa.lab06.solutions.BinaryTree

reverseInOrderNodes() - Method in class dsa.lab06.exercises.BinaryTree

reverseInOrderNodes() - Method in class dsa.lab06.solutions.BinaryTree

ReverseIterator(StaticSequence<Item>) - Constructor for class dsa.lab02.base.StaticSequence.ReverseIterator

Construct a reverse iterator over the items in the given sequence.

ReverseNodeIterator(LinkedList<Item>) - Constructor for class dsa.lab02.base.LinkedList.ReverseNodeIterator

Construct a reverse iterator over the nodes in the given linked list.

reversePostOrder() - Method in class dsa.lab06.exercises.BinaryTree

reversePostOrder() - Method in class dsa.lab06.solutions.BinaryTree

reversePostOrderNodes() - Method in class dsa.lab06.exercises.BinaryTree

reversePostOrderNodes() - Method in class dsa.lab06.solutions.BinaryTree

reversePreOrder() - Method in class dsa.lab06.exercises.BinaryTree

reversePreOrder() - Method in class dsa.lab06.solutions.BinaryTree

reversePreOrderNodes() - Method in class dsa.lab06.exercises.BinaryTree

reversePreOrderNodes() - Method in class dsa.lab06.solutions.BinaryTree

right - Variable in class dsa.lab07.exercises.BinarySearchTree.Node

The right child - possibly null.

right - Variable in class dsa.lab07.solutions.BinarySearchTree.Node

The right child - possibly null.

right() - Method in class dsa.lab06.exercises.BinaryTree.Node

Get the right child node.

right() - Method in class dsa.lab06.solutions.BinaryTree.Node

Get the right child node.

root - Variable in class dsa.lab07.exercises.BinarySearchTree

The root of the BST.

root - Variable in class dsa.lab07.solutions.BinarySearchTree

The root of the BST.

root() - Method in class dsa.lab06.exercises.BinaryTree

Get the root node.

root() - Method in class dsa.lab06.solutions.BinaryTree

Get the root node.

S

search(StaticSequence<Item>, Item) - Method in class dsa.lab04.exercises.BinarySearcher

Finds the index of the given item in the given sequence using binary search.

search(StaticSequence<Item>, Item) - Method in class dsa.lab04.solutions.BinarySearcher

Finds the index of the given item in the given sequence using binary search.

search(StaticSequence<Item>, Comparator<Item>, Item) - Method in class dsa.lab04.exercises.BinarySearcher

Finds the index of the given item in the given sequence using binary search.

search(StaticSequence<Item>, Comparator<Item>, Item) - Method in class dsa.lab04.solutions.BinarySearcher

Finds the index of the given item in the given sequence using binary search.

SelectionSorter - Class in dsa.lab04.exercises

Selection sort.

SelectionSorter - Class in dsa.lab04.solutions

Selection sort.

SelectionSorter() - Constructor for class dsa.lab04.exercises.SelectionSorter

SelectionSorter() - Constructor for class dsa.lab04.solutions.SelectionSorter

set(int, Item) - Method in interface dsa.lab01.base.BadStaticSequence

Set the item at the given index.

set(int, Item) - Method in interface dsa.lab01.base.StaticSequence

Set the item at the given index.

set(int, Item) - Method in interface dsa.lab02.base.LinkedList

set(int, Item) - Method in interface dsa.lab02.base.StaticSequence

Set the item at the given index.

set(int, Item) - Method in class dsa.lab02.exercises.StaticArray

set(int, Item) - Method in class dsa.lab02.solutions.StaticArray

set(int, Item) - Method in class dsa.lab03.exercises.CircularDynamicArray

set(int, Item) - Method in class dsa.lab03.exercises.DynamicArray

set(int, Item) - Method in class dsa.lab03.solutions.CircularDynamicArray

set(int, Item) - Method in class dsa.lab03.solutions.DynamicArray

setFirst(Item) - Method in interface dsa.lab02.base.StaticSequence

Set the first item.

setItem(Item) - Method in interface dsa.lab02.base.LinkedNode

Set the contained item.

setItem(Item) - Method in class dsa.lab02.exercises.DoublyLinkedList.Node

setItem(Item) - Method in class dsa.lab02.exercises.SinglyLinkedList.Node

setItem(Item) - Method in class dsa.lab02.solutions.DoublyLinkedList.Node

setItem(Item) - Method in class dsa.lab02.solutions.SinglyLinkedList.Node

setItem(Item) - Method in class dsa.lab06.exercises.BinaryTree.Node

Set the contained item.

setItem(Item) - Method in class dsa.lab06.solutions.BinaryTree.Node

Set the contained item.

setLast(Item) - Method in interface dsa.lab02.base.StaticSequence

Set the last item.

singleton(Item) - Static method in class dsa.lib.utils.ArrayUtils

singleton(Class<?>, Item) - Static method in class dsa.lib.utils.ArrayUtils

singleton(IntFunction<Item[]>, Item) - Static method in class dsa.lib.utils.ArrayUtils

SinglyLinkedList<Item> - Class in dsa.lab02.exercises

A singly-linked list.

SinglyLinkedList<Item> - Class in dsa.lab02.solutions

A singly-linked list.

SinglyLinkedList() - Constructor for class dsa.lab02.exercises.SinglyLinkedList

Construct an empty singly-linked list.

SinglyLinkedList() - Constructor for class dsa.lab02.solutions.SinglyLinkedList

Construct an empty singly-linked list.

SinglyLinkedList(Item...) - Constructor for class dsa.lab02.exercises.SinglyLinkedList

Construct a singly-linked list containing the given items.

SinglyLinkedList(Item...) - Constructor for class dsa.lab02.solutions.SinglyLinkedList

Construct a singly-linked list containing the given items.

SinglyLinkedList(Iterable<Item>) - Constructor for class dsa.lab02.exercises.SinglyLinkedList

Construct a singly-linked list containing the given items.

SinglyLinkedList(Iterable<Item>) - Constructor for class dsa.lab02.solutions.SinglyLinkedList

Construct a singly-linked list containing the given items.

SinglyLinkedList.Node<Item> - Class in dsa.lab02.exercises

A node in a singly-linked list.

SinglyLinkedList.Node<Item> - Class in dsa.lab02.solutions

A node in a singly-linked list.

size - Variable in class dsa.lab07.exercises.BinarySearchTree

The number of nodes in the BST.

size - Variable in class dsa.lab07.solutions.BinarySearchTree

The number of nodes in the BST.

size() - Method in interface dsa.lab01.base.BadStaticSequence

Get the number of contained items.

size() - Method in interface dsa.lab01.base.Container

Get the number of contained items.

size() - Method in interface dsa.lab01.base.StringContainer

Get the number of contained strings.

size() - Method in class dsa.lab01.exercises.Array

size() - Method in class dsa.lab01.exercises.StringArray

size() - Method in class dsa.lab01.solutions.Array

size() - Method in class dsa.lab01.solutions.StringArray

size() - Method in interface dsa.lab02.base.Container

Get the number of contained items.

size() - Method in class dsa.lab02.exercises.DoublyLinkedList

size() - Method in class dsa.lab02.exercises.SinglyLinkedList

size() - Method in class dsa.lab02.exercises.StaticArray

size() - Method in class dsa.lab02.solutions.DoublyLinkedList

size() - Method in class dsa.lab02.solutions.SinglyLinkedList

size() - Method in class dsa.lab02.solutions.StaticArray

size() - Method in class dsa.lab03.exercises.ArrayQueue

size() - Method in class dsa.lab03.exercises.ArrayStack

size() - Method in class dsa.lab03.exercises.CircularDynamicArray

size() - Method in class dsa.lab03.exercises.DynamicArray

size() - Method in class dsa.lab03.exercises.LinkedQueue

size() - Method in class dsa.lab03.exercises.LinkedStack

size() - Method in class dsa.lab03.solutions.ArrayQueue

size() - Method in class dsa.lab03.solutions.ArrayStack

size() - Method in class dsa.lab03.solutions.CircularDynamicArray

size() - Method in class dsa.lab03.solutions.DynamicArray

size() - Method in class dsa.lab03.solutions.LinkedQueue

size() - Method in class dsa.lab03.solutions.LinkedStack

size() - Method in class dsa.lab04.exercises.ArrayMap

size() - Method in class dsa.lab04.solutions.ArrayMap

size() - Method in class dsa.lab05.exercises.ChainingHashMap

size() - Method in class dsa.lab05.exercises.HashFunction

Get the size of the range of hashes.

size() - Method in class dsa.lab05.exercises.SortedArrayMap

size() - Method in class dsa.lab05.solutions.ChainingHashMap

size() - Method in class dsa.lab05.solutions.HashFunction

Get the size of the range of hashes.

size() - Method in class dsa.lab05.solutions.SortedArrayMap

size() - Method in class dsa.lab06.exercises.BinaryTree.Node

Get the number of contained items.

size() - Method in class dsa.lab06.exercises.BinaryTree

size() - Method in class dsa.lab06.exercises.ProbingHashMap

size() - Method in class dsa.lab06.solutions.BinaryTree.Node

Get the number of contained items.

size() - Method in class dsa.lab06.solutions.BinaryTree

size() - Method in class dsa.lab06.solutions.ProbingHashMap

size() - Method in class dsa.lab07.exercises.BinarySearchTree

size() - Method in class dsa.lab07.solutions.BinarySearchTree

size() - Method in class dsa.lab09.exercises.ArrayPriorityQueue

size() - Method in class dsa.lab09.exercises.BinaryHeapPriorityQueue

size() - Method in class dsa.lab09.exercises.SortedArrayPriorityQueue

size() - Method in class dsa.lab09.solutions.ArrayPriorityQueue

size() - Method in class dsa.lab09.solutions.BinaryHeapPriorityQueue

size() - Method in class dsa.lab09.solutions.SortedArrayPriorityQueue

sort(StaticSequence<Item>) - Method in interface dsa.lab04.base.Sorter

Sorts the given sequence.

sort(StaticSequence<Item>, Comparator<Item>) - Method in interface dsa.lab04.base.Sorter

Sorts the given sequence according to the given comparator.

sort(StaticSequence<Item>, Comparator<Item>) - Method in class dsa.lab04.exercises.InsertionSorter

sort(StaticSequence<Item>, Comparator<Item>) - Method in class dsa.lab04.exercises.MergeSorter

sort(StaticSequence<Item>, Comparator<Item>) - Method in class dsa.lab04.exercises.SelectionSorter

sort(StaticSequence<Item>, Comparator<Item>) - Method in class dsa.lab04.solutions.InsertionSorter

sort(StaticSequence<Item>, Comparator<Item>) - Method in class dsa.lab04.solutions.MergeSorter

sort(StaticSequence<Item>, Comparator<Item>) - Method in class dsa.lab04.solutions.SelectionSorter

sort(StaticSequence<Item>, Comparator<Item>) - Method in class dsa.lab09.exercises.HeapSorter

sort(StaticSequence<Item>, Comparator<Item>) - Method in class dsa.lab09.solutions.HeapSorter

sorted(Item[]) - Static method in class dsa.lib.utils.ArrayUtils

sorted(Item[], Comparator<Item>) - Static method in class dsa.lib.utils.ArrayUtils

sorted(Class<?>, Item[]) - Static method in class dsa.lib.utils.ArrayUtils

sorted(Class<?>, Item[], Comparator<Item>) - Static method in class dsa.lib.utils.ArrayUtils

sorted(IntFunction<Item[]>, Item[]) - Static method in class dsa.lib.utils.ArrayUtils

sorted(IntFunction<Item[]>, Item[], Comparator<Item>) - Static method in class dsa.lib.utils.ArrayUtils

SortedArrayMap<Key,Value> - Class in dsa.lab05.exercises

A sorted array map.

SortedArrayMap<Key,Value> - Class in dsa.lab05.solutions

A sorted array map.

SortedArrayMap() - Constructor for class dsa.lab05.exercises.SortedArrayMap

Construct an empty sorted array map.

SortedArrayMap() - Constructor for class dsa.lab05.solutions.SortedArrayMap

Construct an empty sorted array map.

SortedArrayMap(MapItem<Key, Value>...) - Constructor for class dsa.lab05.exercises.SortedArrayMap

Construct a sorted array map containing the given items.

SortedArrayMap(MapItem<Key, Value>...) - Constructor for class dsa.lab05.solutions.SortedArrayMap

Construct a sorted array map containing the given items.

SortedArrayMap(Iterable<MapItem<Key, Value>>) - Constructor for class dsa.lab05.exercises.SortedArrayMap

Construct a sorted array map containing the given items.

SortedArrayMap(Iterable<MapItem<Key, Value>>) - Constructor for class dsa.lab05.solutions.SortedArrayMap

Construct a sorted array map containing the given items.

SortedArrayMap(Iterable<MapItem<Key, Value>>, int) - Constructor for class dsa.lab05.exercises.SortedArrayMap

Construct a sorted array map containing the given items more efficiently than SortedArrayMap(Iterable).

SortedArrayMap(Iterable<MapItem<Key, Value>>, int) - Constructor for class dsa.lab05.solutions.SortedArrayMap

Construct a sorted array map containing the given items more efficiently than SortedArrayMap(Iterable).

SortedArrayPriorityQueue<Priority,Item> - Class in dsa.lab09.exercises

A sorted array priority queue.

SortedArrayPriorityQueue<Priority,Item> - Class in dsa.lab09.solutions

A sorted array priority queue.

SortedArrayPriorityQueue() - Constructor for class dsa.lab09.exercises.SortedArrayPriorityQueue

Construct an empty sorted array priority queue.

SortedArrayPriorityQueue() - Constructor for class dsa.lab09.solutions.SortedArrayPriorityQueue

Construct an empty sorted array priority queue.

SortedArrayPriorityQueue(PriorityQueueItem<Priority, Item>...) - Constructor for class dsa.lab09.exercises.SortedArrayPriorityQueue

Construct a sorted array priority queue containing the given items.

SortedArrayPriorityQueue(PriorityQueueItem<Priority, Item>...) - Constructor for class dsa.lab09.solutions.SortedArrayPriorityQueue

Construct a sorted array priority queue containing the given items.

SortedArrayPriorityQueue(Iterable<PriorityQueueItem<Priority, Item>>) - Constructor for class dsa.lab09.exercises.SortedArrayPriorityQueue

Construct a sorted array priority queue containing the given items.

SortedArrayPriorityQueue(Iterable<PriorityQueueItem<Priority, Item>>) - Constructor for class dsa.lab09.solutions.SortedArrayPriorityQueue

Construct a sorted array priority queue containing the given items.

SortedArrayPriorityQueue(Iterable<PriorityQueueItem<Priority, Item>>, int) - Constructor for class dsa.lab09.exercises.SortedArrayPriorityQueue

Construct a sorted array priority queue containing the given items more efficiently than SortedArrayPriorityQueue(Iterable).

SortedArrayPriorityQueue(Iterable<PriorityQueueItem<Priority, Item>>, int) - Constructor for class dsa.lab09.solutions.SortedArrayPriorityQueue

Construct a sorted array priority queue containing the given items more efficiently than SortedArrayPriorityQueue(Iterable).

Sorter - Interface in dsa.lab04.base

A sorting algorithm.

Stack<Item> - Interface in dsa.lab03.base

A stack.

StaticArray<Item> - Class in dsa.lab02.exercises

A static array.

StaticArray<Item> - Class in dsa.lab02.solutions

A static array.

StaticArray() - Constructor for class dsa.lab02.exercises.StaticArray

Construct an empty static array.

StaticArray() - Constructor for class dsa.lab02.solutions.StaticArray

Construct an empty static array.

StaticArray(Item...) - Constructor for class dsa.lab02.exercises.StaticArray

Construct a static array containing the given items.

StaticArray(Item...) - Constructor for class dsa.lab02.solutions.StaticArray

Construct a static array containing the given items.

StaticArray(Iterable<Item>) - Constructor for class dsa.lab02.exercises.StaticArray

Construct a static array containing the given items.

StaticArray(Iterable<Item>) - Constructor for class dsa.lab02.solutions.StaticArray

Construct a static array containing the given items.

StaticArray(Iterable<Item>, int) - Constructor for class dsa.lab02.exercises.StaticArray

Construct a static array containing the given items more efficiently than StaticArray(Iterable).

StaticArray(Iterable<Item>, int) - Constructor for class dsa.lab02.solutions.StaticArray

Construct a static array containing the given items more efficiently than StaticArray(Iterable).

StaticSequence<Item> - Interface in dsa.lab01.base

A static sequence.

StaticSequence<Item> - Interface in dsa.lab02.base

A static sequence.

StaticSequence.ForwardIterator<Item> - Class in dsa.lab02.base

A forward iterator over the items in a sequence.

StaticSequence.ReverseIterator<Item> - Class in dsa.lab02.base

A reverse iterator over the items in a sequence.

StringArray - Class in dsa.lab01.exercises

An array-based string container.

StringArray - Class in dsa.lab01.solutions

An array-based string container.

StringArray() - Constructor for class dsa.lab01.exercises.StringArray

Construct an empty string array.

StringArray() - Constructor for class dsa.lab01.solutions.StringArray

Construct an empty string array.

StringArray(String...) - Constructor for class dsa.lab01.exercises.StringArray

Construct a string array containing the given strings.

StringArray(String...) - Constructor for class dsa.lab01.solutions.StringArray

Construct a string array containing the given strings.

StringContainer - Interface in dsa.lab01.base

A string container.

StringUtils - Class in dsa.lib.utils

swap(int, int) - Method in interface dsa.lab02.base.StaticSequence

Swaps the two items at the given indices.

T

toCompactString() - Method in class dsa.lab06.exercises.BinaryTree.Node

toCompactString() - Method in class dsa.lab06.exercises.BinaryTree

toCompactString() - Method in class dsa.lab06.solutions.BinaryTree.Node

toCompactString() - Method in class dsa.lab06.solutions.BinaryTree

toCompactString() - Method in class dsa.lab07.exercises.BinarySearchTree.Node

toCompactString() - Method in class dsa.lab07.exercises.BinarySearchTree

toCompactString() - Method in class dsa.lab07.solutions.BinarySearchTree.Node

toCompactString() - Method in class dsa.lab07.solutions.BinarySearchTree

toCompactString(BinaryTree.Node<Item>) - Static method in class dsa.lab06.exercises.BinaryTree.Node

toCompactString(BinaryTree.Node<Item>) - Static method in class dsa.lab06.solutions.BinaryTree.Node

toCompactString(BinarySearchTree.Node<Key, Value>) - Static method in class dsa.lab07.exercises.BinarySearchTree.Node

toCompactString(BinarySearchTree.Node<Key, Value>) - Static method in class dsa.lab07.solutions.BinarySearchTree.Node

toDebugString(Object) - Static method in class dsa.lib.utils.ToDebugStringUtils

ToDebugStringUtils - Class in dsa.lib.utils

top() - Method in interface dsa.lab03.base.Stack

Get the item on top.

top() - Method in class dsa.lab03.exercises.ArrayStack

top() - Method in class dsa.lab03.exercises.LinkedStack

top() - Method in class dsa.lab03.solutions.ArrayStack

top() - Method in class dsa.lab03.solutions.LinkedStack

toString(Iterable<Item>) - Static method in class dsa.lib.utils.IterableUtils

toString(Iterable<Item>, String) - Static method in class dsa.lib.utils.IterableUtils

toString(Object) - Static method in class dsa.lib.utils.ToStringUtils

toString(Object[]) - Static method in class dsa.lib.utils.ArrayUtils

toString(Object[], String) - Static method in class dsa.lib.utils.ArrayUtils

toString(Object, String) - Static method in class dsa.lib.utils.ToStringUtils

toString(String) - Method in class dsa.lab01.exercises.Array

toString(String) - Method in class dsa.lab01.exercises.StringArray

toString(String) - Method in class dsa.lab01.solutions.Array

toString(String) - Method in class dsa.lab01.solutions.StringArray

toString(String) - Method in interface dsa.lab02.base.Container

toString(String) - Method in interface dsa.lab02.base.LinkedNode

toString(String) - Method in class dsa.lab04.base.MapItem

toString(String) - Method in class dsa.lab05.exercises.HashFunction

toString(String) - Method in class dsa.lab05.solutions.HashFunction

toString(String) - Method in class dsa.lab06.exercises.BinaryTree.Node

toString(String) - Method in class dsa.lab06.exercises.BinaryTree

toString(String) - Method in class dsa.lab06.solutions.BinaryTree.Node

toString(String) - Method in class dsa.lab06.solutions.BinaryTree

toString(String) - Method in class dsa.lab07.exercises.BinarySearchTree.Node

toString(String) - Method in class dsa.lab07.exercises.BinarySearchTree

toString(String) - Method in class dsa.lab07.solutions.BinarySearchTree.Node

toString(String) - Method in class dsa.lab07.solutions.BinarySearchTree

toString(String) - Method in class dsa.lab09.base.PriorityQueueItem

toString(String) - Static method in class dsa.lib.utils.StringUtils

toString(Node, Function<Node, Node>, Function<Node, Node>, Function<Node, Item>, String) - Static method in class dsa.lib.utils.BinaryNodeUtils

toString(Tree, Function<Tree, Node>, String) - Static method in class dsa.lib.utils.BinaryTreeUtils

ToStringUtils - Class in dsa.lib.utils

toTypedString(Object, String) - Static method in class dsa.lib.utils.ToStringUtils

toUntypedString(Iterable<Item>) - Static method in class dsa.lib.utils.IterableUtils

toUntypedString(Iterable<Item>, String) - Static method in class dsa.lib.utils.IterableUtils

toUntypedString(Object[]) - Static method in class dsa.lib.utils.ArrayUtils

toUntypedString(Object[], String) - Static method in class dsa.lib.utils.ArrayUtils

tree - Variable in class dsa.lab07.exercises.BinarySearchTree.Node

The containing BST.

tree - Variable in class dsa.lab07.solutions.BinarySearchTree.Node

The containing BST.

tree() - Method in class dsa.lab06.exercises.BinaryTree.Node

Get the containing binary tree.

tree() - Method in class dsa.lab06.solutions.BinaryTree.Node

Get the containing binary tree.

V

value() - Method in class dsa.lab04.base.MapItem

Get the value (the rest of the item, or the corresponding value, depending on your view).

valueOf(String) - Static method in enum class dsa.lab06.exercises.BinaryTree.IterationOrder

Returns the enum constant of this class with the specified name.

valueOf(String) - Static method in enum class dsa.lab06.solutions.BinaryTree.IterationOrder

Returns the enum constant of this class with the specified name.

values() - Method in interface dsa.lab04.base.Map

Get an iterable that yields each value once.

values() - Static method in enum class dsa.lab06.exercises.BinaryTree.IterationOrder

Returns an array containing the constants of this enum class, in the order they are declared.

values() - Static method in enum class dsa.lab06.solutions.BinaryTree.IterationOrder

Returns an array containing the constants of this enum class, in the order they are declared.

_

_isAVLConditionSatisfied() - Method in class dsa.lab08.exercises.AVLTree

_isAVLConditionSatisfied() - Method in class dsa.lab08.solutions.AVLTree

_isHeightCacheCorrect() - Method in class dsa.lab08.exercises.AVLTree

_isHeightCacheCorrect() - Method in class dsa.lab08.solutions.AVLTree

A B C D E F G H I K L M N O P Q R S T V _
All Classes and Interfaces|All Packages