DIYCompSci

Sorting

• Quicksort
• Merge Sort

Data Structures

• arrays
• linked lists
• stacks
• queues
• hash-sets

Hash Table

• implement and explain

Trees

• binary trees
• n-ary trees similar to trie-tree
• trie-trees
• red/black tree or splay tree or AVL tree

Graphs

there are three basic ways to represent a graph in memory

• objects and pointers
• matrix
• adjacency list

Traversal

• BFS
• DFS
• Inorder and postorder and preorder traversal: DIYBinaryTree

Algorithms

• divide-and-conquer
• dynamic programming/memoization
• greediness
• recursion or algorithms linked to a specific data structure.

Fancy Algorithms

• Dijkstra
• A*