Index
All Classes and Interfaces|All Packages
A
- AbstractBinaryTree<T> - Class in dsa.impl
- AbstractBinaryTree() - Constructor for class dsa.impl.AbstractBinaryTree
- AbstractBinaryTree.BTPosition - Class in dsa.impl
B
- BTPosition(T, AbstractBinaryTree.BTPosition) - Constructor for class dsa.impl.AbstractBinaryTree.BTPosition
- BTPosition(T, AbstractBinaryTree.BTPosition, AbstractBinaryTree.BTPosition, AbstractBinaryTree.BTPosition) - Constructor for class dsa.impl.AbstractBinaryTree.BTPosition
C
- children(IPosition<T>) - Method in interface dsa.iface.ITree
-
Get an Iterator to iterate over the child positions of
p
. - children(IPosition<T>) - Method in class dsa.impl.AbstractBinaryTree
D
- dequeue() - Method in interface dsa.iface.IQueue
-
Remove and return the first element in the queue.
- dequeue() - Method in class dsa.impl.LinkedQueue
- dsa.iface - package dsa.iface
- dsa.impl - package dsa.impl
E
- element - Variable in class dsa.impl.AbstractBinaryTree.BTPosition
- element() - Method in interface dsa.iface.IPosition
-
Get the element stored in this position.
- element() - Method in class dsa.impl.AbstractBinaryTree.BTPosition
- enqueue(T) - Method in interface dsa.iface.IQueue
-
Add
element
to the back of the queue. - enqueue(T) - Method in class dsa.impl.LinkedQueue
F
- first() - Method in interface dsa.iface.IList
-
Get the first node in the list.
- first() - Method in class dsa.impl.SLinkedList
- front() - Method in interface dsa.iface.IQueue
-
Get (but don't remove) the element at the front of the queue.
- front() - Method in class dsa.impl.LinkedQueue
H
- hasLeft(IPosition<T>) - Method in interface dsa.iface.IBinaryTree
-
Check whether position
p
has a left child. - hasLeft(IPosition<T>) - Method in class dsa.impl.AbstractBinaryTree
- hasNext() - Method in class dsa.impl.ListIterator
- hasRight(IPosition<T>) - Method in interface dsa.iface.IBinaryTree
-
Check whether position
p
has a right child. - hasRight(IPosition<T>) - Method in class dsa.impl.AbstractBinaryTree
I
- IBinaryTree<T> - Interface in dsa.iface
-
Interface to represent a Binary Tree.
- IList<T> - Interface in dsa.iface
-
ADT to represent a List data structure.
- insertAfter(IPosition<T>, T) - Method in interface dsa.iface.IList
-
Insert element
e
into the list in the position after nodep
. - insertAfter(IPosition<T>, T) - Method in class dsa.impl.SLinkedList
- insertBefore(IPosition<T>, T) - Method in interface dsa.iface.IList
-
Insert element
e
into the list in the position before nodep
. - insertBefore(IPosition<T>, T) - Method in class dsa.impl.SLinkedList
- insertFirst(T) - Method in interface dsa.iface.IList
-
Insert element
e
as the first element of the list. - insertFirst(T) - Method in class dsa.impl.SLinkedList
- insertLast(T) - Method in interface dsa.iface.IList
-
Insert element
e
as the last element of the list. - insertLast(T) - Method in class dsa.impl.SLinkedList
- IPosition<T> - Interface in dsa.iface
-
Position ADT.
- IQueue<T> - Interface in dsa.iface
-
ADT to represent a Queue.
- isEmpty() - Method in interface dsa.iface.IList
-
Check if the list is empty.
- isEmpty() - Method in interface dsa.iface.IQueue
-
Check if the queue is empty.
- isEmpty() - Method in interface dsa.iface.ITree
-
Test whether the tree is empty.
- isEmpty() - Method in class dsa.impl.AbstractBinaryTree
- isEmpty() - Method in class dsa.impl.LinkedQueue
- isEmpty() - Method in class dsa.impl.SLinkedList
- isExternal(IPosition<T>) - Method in interface dsa.iface.ITree
-
Test whether position
p
is external (i.e. - isExternal(IPosition<T>) - Method in class dsa.impl.AbstractBinaryTree
- isInternal(IPosition<T>) - Method in interface dsa.iface.ITree
-
Test whether position
p
is internal (i.e. - isInternal(IPosition<T>) - Method in class dsa.impl.AbstractBinaryTree
- isRoot(IPosition<T>) - Method in interface dsa.iface.ITree
-
Test whether position
p
is the root of the tree. - isRoot(IPosition<T>) - Method in class dsa.impl.AbstractBinaryTree
- iterator() - Method in interface dsa.iface.IList
-
Get an iterator that can iterate over the list's elements.
- iterator() - Method in interface dsa.iface.ITree
-
Get an Iterator that iterates over all the elements contained in the tree's positions.
- iterator() - Method in class dsa.impl.AbstractBinaryTree
- iterator() - Method in class dsa.impl.SLinkedList
- ITree<T> - Interface in dsa.iface
-
Interface representing a Tree data structure.
L
- last() - Method in interface dsa.iface.IList
-
Get the last node in the list.
- last() - Method in class dsa.impl.SLinkedList
- left - Variable in class dsa.impl.AbstractBinaryTree.BTPosition
- left(IPosition<T>) - Method in interface dsa.iface.IBinaryTree
-
Get the left child of position
p
. - left(IPosition<T>) - Method in class dsa.impl.AbstractBinaryTree
- LinkedQueue<T> - Class in dsa.impl
- LinkedQueue() - Constructor for class dsa.impl.LinkedQueue
- ListIterator<T> - Class in dsa.impl
-
Iterate over the elements of a
IList
. - ListIterator(IList<T>) - Constructor for class dsa.impl.ListIterator
N
- newPosition(T, AbstractBinaryTree.BTPosition) - Method in class dsa.impl.AbstractBinaryTree
- next() - Method in class dsa.impl.ListIterator
- next(IPosition<T>) - Method in interface dsa.iface.IList
-
Get the node after
p
in the list. - next(IPosition<T>) - Method in class dsa.impl.SLinkedList
P
- parent - Variable in class dsa.impl.AbstractBinaryTree.BTPosition
- parent(IPosition<T>) - Method in interface dsa.iface.ITree
-
Get the parent of position
p
(ornull
if the position has no parent (i.e. - parent(IPosition<T>) - Method in class dsa.impl.AbstractBinaryTree
- positions() - Method in interface dsa.iface.ITree
-
Get an Iterator that iterates over all the positions in the tree.
- positions() - Method in class dsa.impl.AbstractBinaryTree
- prev(IPosition<T>) - Method in interface dsa.iface.IList
-
Get the node before
p
in the list. - prev(IPosition<T>) - Method in class dsa.impl.SLinkedList
R
- remove(IPosition<T>) - Method in interface dsa.iface.IList
-
Remove node
p
from the list. - remove(IPosition<T>) - Method in class dsa.impl.SLinkedList
- replace(IPosition<T>, T) - Method in interface dsa.iface.IList
-
Replace the element stored in node
p
withe
. - replace(IPosition<T>, T) - Method in interface dsa.iface.ITree
-
Replace the element contained in a position.
- replace(IPosition<T>, T) - Method in class dsa.impl.AbstractBinaryTree
- replace(IPosition<T>, T) - Method in class dsa.impl.SLinkedList
- right - Variable in class dsa.impl.AbstractBinaryTree.BTPosition
- right(IPosition<T>) - Method in interface dsa.iface.IBinaryTree
-
Get the right child of position
p
. - right(IPosition<T>) - Method in class dsa.impl.AbstractBinaryTree
- root - Variable in class dsa.impl.AbstractBinaryTree
- root() - Method in interface dsa.iface.ITree
-
Get the root position of the tree.
- root() - Method in class dsa.impl.AbstractBinaryTree
S
- size - Variable in class dsa.impl.AbstractBinaryTree
- size() - Method in interface dsa.iface.IList
-
Get the number of elements in the list.
- size() - Method in interface dsa.iface.IQueue
-
Get the number of elements in the queue.
- size() - Method in interface dsa.iface.ITree
-
Get the size of the tree (i.e.
- size() - Method in class dsa.impl.AbstractBinaryTree
- size() - Method in class dsa.impl.LinkedQueue
- size() - Method in class dsa.impl.SLinkedList
- SLinkedList<T> - Class in dsa.impl
- SLinkedList() - Constructor for class dsa.impl.SLinkedList
T
- toString() - Method in class dsa.impl.AbstractBinaryTree
- toString() - Method in class dsa.impl.LinkedQueue
All Classes and Interfaces|All Packages