Please enable JavaScript.
Coggle requires JavaScript to display documents.
Data Structures & Algorithms - Coggle Diagram
Data Structures & Algorithms
Data Structures
Lists
ArrayList
LinkedList
Graphs
Trees
Binary Search Tree (BST)
AVL Tree
Depth-First Tree Tranversals
Breadth-First Tree Traversals
Heap
Tries
Bloom Filters
Search Algorithms
Linear Search
Binary Search
Binary Search Tree ( BST)
Sorting Algorithms
O(n ^ 2)
Selection Sort
Insertion Sort
Bubble Sort
O(n ^ K)
Radix Sort
O(n log n)
Heap Sort
Merge Sort
Quick Sort
Big O Notation
Time Complexity
Quadratic O(n ^ 2)
Logarithmic - O(log n)
Cubic O(n ^3)
Linear O(n)
Exponential O(2 ^n)
Constant - O(1)
Space Complexity
Input Space
it's the space needed during execution considering the size of the input.
Auxiliary Space
It's a temporary space that is used by the algorithm for execution.
Is a mathematical measure of amount of memory your algorithm, function, program needs to store it's variables.
Tree Tranversal Algorithms
In-Order
Post-Order
Pre-Order
Graph Tranversal Algortihms
Depth-First Search (DFS)
Breadth-First Search (BFS)