- last() - Method in class net.datastructures.NodePositionList
-
Returns the last position in the list; O(1) time
- last() - Method in interface net.datastructures.PositionList
-
Returns the last node in the list.
- last() - Method in class support.graph.NodeSequence
-
- left(Position<E>) - Method in class net.datastructures.ArrayListCompleteBinaryTree
-
Returns the left child of v.
- left(Position<E>) - Method in interface net.datastructures.BinaryTree
-
Returns the left child of a node.
- left - Variable in class net.datastructures.EulerTour.TourResult
-
- left(Position<E>) - Method in class net.datastructures.LinkedBinaryTree
-
Returns the left child of a node.
- LinkedBinaryTree<E> - Class in net.datastructures
-
An implementation of the BinaryTree interface by means of a linked structure.
- LinkedBinaryTree() - Constructor for class net.datastructures.LinkedBinaryTree
-
Creates an empty binary tree.
- LinkedTree<E> - Class in net.datastructures
-
A linked class for a tree where nodes have an arbitrary number of children.
- LinkedTree() - Constructor for class net.datastructures.LinkedTree
-
Creates an empty tree.