![[R logo]](../../../doc/html/logo.jpg)
| Containers-package | Containers |
| back.Deque | Inspect the Back Element of a Deque |
| balance.BST | Balance a Binary Search Tree |
| balance.SplayTree | Balance a Splay Tree |
| BST | Constructor for Class BST |
| capacity.Heap | Determine a Heap's Memory Allocation |
| clear.Container | Empty a Container |
| clone.Container | Clone a Container |
| Container | Constructor for Class Container |
| contract.Heap | Contract a Heap |
| current.Iterator | Inspect an Iterator's Current Element of Interest |
| Deque | Constructor for Class Deque |
| find.BST | Search a Binary Search Tree |
| front.Queue | Inspect the Front Element of a Queue |
| Heap | Constructor for Class Heap |
| height.BST | Determine the Height of a Binary Search Tree |
| insert.BST | Insert an Element into a Binary Search Tree |
| insert.Heap | Insert an Element into a Heap |
| insertBack.Queue | Insert an Element into a Queue |
| insertFront.Deque | Insert an Element at the Front of a Deque |
| isEmpty.Container | Determine Whether a Container is Empty |
| isItem.Iterator | Determine Whether an Iterator is Valid |
| Iterator | Constructor for Class Iterator |
| iterator.Heap | Get a Heap Iterator |
| iterator.Queue | Get a Queue Iterator |
| iterator.Stack | Get a Stack Iterator |
| MaxHeap | Constructor for Class MaxHeap |
| maximum.BST | Inspect the Largest Element of a Binary Search Tree |
| MinHeap | Constructor for Class MinHeap |
| minimum.BST | Inspect the Smallest Element of a Binary Search Tree |
| moveBackward.Iterator | Move an Iterator Backward |
| moveForward.Iterator | Move an Iterator Forward |
| peekMax.MaxHeap | Inspect the Root of a Max-Heap |
| peekMin.MinHeap | Inspect the Root of a Min-Heap |
| pop.Stack | Remove the Top Element of a Stack |
| predecessor.BST | Get the In-Order Predecessor of an Element of a Binary Search Tree |
| push.Stack | Push an Element onto a Stack |
| Queue | Constructor for Class Queue |
| remove.BST | Remove an Element from a Binary Search Tree |
| removeBack.Deque | Remove the Back Element of a Deque |
| removeFront.Queue | Remove the Front Element of a Queue |
| removeMax.MaxHeap | Remove the Root Element of a Max-Heap |
| removeMin.MinHeap | Remove the Root Element of a Min-Heap |
| rstart.Iterator | Prepare an Iterator for Reverse Iteration |
| size.Container | Determine the Size of a Container |
| SplayTree | Constructor for Class SplayTree |
| Stack | Constructor for Class Stack |
| start.Iterator | Prepare an Iterator for Forward Iteration |
| successor.BST | Get the In-Order Successor of an Element of a Binary Search Tree |
| top.Stack | Inspect the Top Element of a Stack |