Please enable JavaScript.
Coggle requires JavaScript to display documents.
ADA - Coggle Diagram
ADA
Graphs
Graph Traversal
BFS
DFS
Inorder
Preorder
Postorder
Shortest Path
Dijkstra
Bellman Ford
Trees
Linked List
Singly
Doubly
Binary Tree
BST
Balanced BST
AVL
Red Black Tree
Heap
Binary Heap
Priority Queue
Trie
Tree Traversal
DFS
BFS
Arrays
Sorting
Merge Sort
Quick Sort
Heap Sort
Bubble Sort
Selection Sort
Insertion Sort
Radix Sort
Searching
Is it sorted ?
Yes
Divide and Conquer - Binary Search
No
Will sorting help ?
Yes
Sort and do Binary Search
No
Linear Search
Hash Tables
Collisions ?
Linked List
Fast Access O(1)
Tradeoff. use more memory O(n)
Stacks
Array Stack
Linked List Stack
Queues
Array Queue
Linked List Queue
Dynamic Programming
Memoiation