Forked from emmabostian/data structures and algorithms
Created
March 16, 2022 17:36
-
-
Save JamesHopbourn/4e9dc21bef5b7158d93fb2b082256bfd to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Data Structures | |
| - Stacks | |
| - Queues | |
| - Linked lists | |
| - Graphs | |
| - Trees | |
| - Tries | |
| Concepts | |
| - Big O Notation | |
| - Recursion | |
| Sorting algorithms | |
| - Merge sort | |
| - Quick sort | |
| - Insertion sort | |
| Searching algorithms | |
| - Binary search | |
| - Depth-first search | |
| - Breadth-first search | |
| Tree traversals | |
| - In-order traversal | |
| - Pre-order traversal | |
| - Post-order traversal |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment