Please enable JavaScript.
Coggle requires JavaScript to display documents.
Data Structures - Coggle Diagram
Data Structures
STL
multimap
equal_range()
Sorted
unordered_multimap
same multimap but not sorted
hash function
unordered_map
same map but not sorted
hash function
set
unique elements in a sorted order
Hash function
map
insert(make_pair(key,val))
count()
map<key,val>
find()
Sorted
unordered_set
unsorted set
hash function
forward_list -> Singly Linked List
push_front()
pop_front()
multiset
unique elements in a sorted order
hash function
list -> Double Liked list
pop_front()
push_back()
push_front()
pop_back()
unordered_multiset
unsorted set
hash function
priority_queue
push()
pop()
top()
bitset
deque
pop_front()
push_front()
pop_back()
push_back()
valarray
vector
push_back()
pop_back()
emplace_back()
Tree
AVL Tree
Red-Black Tree
Binary Search Tree
B-Tree
Binary Tree
preorder
root left right
inorder
left root right
postorder
left right root
Trie
Heap
Segment Tree
Quadtree
Queue
empty -> return true of false
size -> return size of queue
Pop -> remove first of queue
back - > return reference of last element
Push / emplace -> add last of queue
front -> return reference of the first element
swap -> q1.swap(q2)
Stack
Top/Peek -> This operation retrieves the element at the top of the stack without removing it.
Empty -> This operation checks if the stack is empty.
Pop -> This operation removes the element from the top of the stack.
Push -> This operation adds an element to the top of the stack.
Size -> This operation returns the number of elements in the stack.
Linked list
Doubly Linked List
Circular Linked List
Singly Linked List
Insertion
Deletion
Traversal and Display
Search
Length and Count
Reversal and Rotation
Merging and Splitting
Skip List