- parent(Position<E>) - Method in class net.datastructures.ArrayListCompleteBinaryTree
-
Returns the parent of v.
- parent(Position<E>) - Method in class net.datastructures.LinkedBinaryTree
-
Returns the parent of a node.
- parent(Position<E>) - Method in class net.datastructures.LinkedTree
-
Returns the parent of a node.
- parent(Position<E>) - Method in interface net.datastructures.Tree
-
Returns the parent of a given node.
- pop() - Method in class net.datastructures.ArrayStack
-
Removes the top element from the stack.
- pop() - Method in class net.datastructures.NodeStack
-
- pop() - Method in interface net.datastructures.Stack
-
Remove the top element from the stack.
- Position<E> - Interface in net.datastructures
-
An interface for a position, which is a holder object storing a
single element.
- PositionList<E> - Interface in net.datastructures
-
An interface for positional lists.
- positions() - Method in class net.datastructures.ArrayListCompleteBinaryTree
-
Returns an iterable collection of all the nodes in the tree.
- positions() - Method in class net.datastructures.LinkedBinaryTree
-
Returns an iterable collection of the tree nodes.
- positions() - Method in class net.datastructures.LinkedTree
-
Returns an iterable collection of the tree nodes.
- positions() - Method in class net.datastructures.NodePositionList
-
Returns an iterable collection of all the nodes in the list.
- positions() - Method in interface net.datastructures.PositionList
-
Returns an iterable collection of all the nodes in the list.
- positions() - Method in interface net.datastructures.Tree
-
Returns an iterable collection of the the nodes.
- positions() - Method in class support.graph.NodeSequence
-
- prev(Position<E>) - Method in class net.datastructures.NodePositionList
-
Returns the position before the given one; O(1) time
- prev(Position<E>) - Method in interface net.datastructures.PositionList
-
Returns the node before a given node in the list.
- prev(Position<E>) - Method in class support.graph.NodeSequence
-
- PriorityQueue<K,V> - Interface in net.datastructures
-
Interface for the priority queue ADT
- push(E) - Method in class net.datastructures.ArrayStack
-
Inserts an element at the top of the stack.
- push(E) - Method in class net.datastructures.NodeStack
-
- push(E) - Method in interface net.datastructures.Stack
-
Insert an element at the top of the stack.
- put(K, V) - Method in class net.datastructures.HashTableMap
-
Put a key-value pair in the map, replacing previous one if it exists.
- put(K, V) - Method in interface net.datastructures.Map
-
Puts a given key-value pair in the map, replacing a previous
one, if any, and returns the old value.