# Index

## buckets.arrays

Contains various functions for manipulating arrays.## buckets.Bag

A bag is a special kind of set in which members are allowed to appear more than once.

## buckets.BSTree

Binary search trees keep their elements in sorted order, so that lookup and other operations can use the principle of binary search.

## buckets.Dictionary

Dictionaries map keys to values, each key can map to at most one value.

## buckets.Heap

A heap is a binary tree that maintains the heap property: Every node is less than or equal to each of its children.

## buckets.LinkedList

A linked list is a sequence of items arranged one after another.## buckets.MultiDictionary

A multi dictionary is a special kind of dictionary that holds multiple values against each key.

## buckets.PriorityQueue

In a priority queue each element is associated with a "priority", elements are dequeued in highest-priority-first order (the elements with the highest priority are dequeued first).

## buckets.Queue

A queue is a First-In-First-Out (FIFO) data structure, the first element added to the queue will be the first one to be removed.## buckets.Set

A set is a data structure that contains no duplicate items.