Package `python_datastructures`

Sub-modules

python_datastructures.binarySearchTree: Binary search tree, also called an ordered or sorted binary tree (BST), is a rooted binary tree whose internal nodes each store a key greater than all …
python_datastructures.circularList: Circular linked list is a datastructure where every node points to its next node in the sequence but the last node points to the first node in the …
python_datastructures.dequeue: In computer science, a double-ended queue is an abstract data type that generalizes a queue, for which elements can be added to or removed from either …
python_datastructures.doublylinkedlist: Doubly linked list is a linked data structure that consists of a set of sequentially linked records called nodes. Each node contains three fields: two …
python_datastructures.heap: Heap is a specialized tree-based data structure which is essentially an almost complete[1] tree that satisfies the heap property: in a max heap, for …
python_datastructures.linkedlist: Linked list is a linear collection of data elements whose order is not given by their physical placement in memory. Instead, each element points to …
python_datastructures.queue: In computer science, a queue is a collection of entities that are maintained in a sequence and can be modified by the addition of entities at one end …
python_datastructures.stack: Stack is an abstract data type that serves as a collection of elements, with two main principal operations: Push, which adds an element to the …
python_datastructures.trie: Trie, also called digital tree or prefix tree, is a kind of search tree—an ordered tree data structure used to store a dynamic set or associative …