Anwarvic
extra-collections
Linked List
⏱ Time-Complexity
☕️ API
Doubly Linked List
⏱ Time-Complexity
☕️ API
Circular Linked List
⏱ Time-Complexity
☕️ API
Stack
⏱ Time-Complexity
☕️ API
Queue
⏱ Time-Complexity
☕️ API
Deque
⏱ Time-Complexity
☕️ API
Priority Queue
⏱ Time-Complexity
☕️ API
Skip List
⏱ Time-Complexity
☕️ API
Tree
⏱ Time-Complexity
TreeNode()
Tree()
Binary Tree
⏱ Time-Complexity
BinaryTreeNode()
BinaryTree()
Binary Search Tree (BST)
⏱ Time-Complexity
☕️ API
Splay Tree
⏱ Time-Complexity
☕️ API
AVL Tree
⏱ Time-Complexity
☕️ API
Red-Black Tree
⏱ Time-Complexity
☕️ API
Min Heap
⏱ Time-Complexity
☕️ API
Max Heap
⏱ Time-Complexity
☕️ API
Treap
⏱ Time-Complexity
☕️ API
Trie
⏱ Time-Complexity
☕️ API
Radix Trie
⏱ Time-Complexity
☕️ API
Suffix Trie
⏱ Time-Complexity
☕️ API
Read the Docs
v: latest
Versions
latest
stable
Downloads
On Read the Docs
Project Home
Builds
Free document hosting provided by
Read the Docs
.
Docs
Search
Please activate JavaScript to enable the search functionality.