Please enable JavaScript.
Coggle requires JavaScript to display documents.
Tree (Binary Search Tree ( BST ) (Traversal (PreOrder (Root -> Left …
Tree
Binary Search Tree ( BST )
The left subtree of a node contains only nodes with keys lesser than the node’s key.
The right subtree of a node contains only nodes with keys greater than the node’s key.
The left and right subtree each must also be a binary search tree.
Traversal
PreOrder
(Root -> Left -> Right)
Prints before recursive calls
InOrder
(Left -> Root -> Right)
Prints between recursive calls
PostOrder
(Left -> Right -> Root)
Prints after recursive calls
LevelOrder
Balanced Binary Search Tree
AVL Tree (Self balanced Binary Search Tree)
Red-Black Tree
Insert O(n)
Delete O(n)
Remove O(n)
Search O(n)
Heap
Priority Queue
Construction O( n )
Polling O( log n )
Peeking O( 1 )
Adding O( log n )
Binary Heap
MAX heap
MIN heap
Binominal Heap
Binary Tree
Trie
root node
child node
Leaf node (no children)
subtree
Queue (FIFO)
Implementation
Using Array
Using LinkedList
Dequeue O(1)
Peeking O(1)
isEmpty O(1)
Contains O(n)
Removal O(n)
Enqueue O(1)
Stack (LIFO)
Implementation
Using LinkedList
Using Array
Push O(1)
Pop O(1)
Peek O(1)
Size O(1)
Search O(n)
GraphsUnweighted
Directed
Undirected
Weighted
Unweighted
Cyclic
Acyclic
Array
Static array
Dynamic Array
Linked List
Singly Linked List
Doubly Linked List
Map
HashMap
HashTable
1
2
3
1
3
2
2
1
3
