1783f371e9
Wahoo! I need to remember that the inorder traversal of a BST should be sorted. This piece of trivia comes in handy for a variety of BST related problems. I also think being able to do a {pre,in,post}-order traversal recursively and iteratively is a skill that I need to develop. |
||
---|---|---|
.. | ||
advent-of-code-2019 | ||
crack_the_coding_interview | ||
data_structures_and_algorithms | ||
deepmind | ||
groceries | ||
haskell-programming-from-first-principles | ||
README.md |
Scratch
The purpose of the scratch
directory is to host practice exercises. Practice
encompasses things like working on data structures and algorithms problems for
upcoming coding interviews or general aptitude as well as writing code snippets
to help me learn a new programming language or understand an unfamiliar concept.