If you, like me, have been mystified by binary trees in your data structures journey, you might enjoy this little cheat sheet I built for myself to try to remember the differences in implementing depth-first searches in pre-, post-, and in-order traversal. Breadth-first search takes a little more set-up, but there’s only one method of traversal there to remember. While studying trees, I noticed that the code for all 3 DFS is super-similar except for tiny changes in the helper function that’s used to move from node to node.

This code is written in JavaScript, but it’s very simple and…


Although I haven’t been a lifelong computer programmer, I’ve loved videogames ever since my little brother and I convinced our very stern Soviet father to buy us an N64 on Ebay. We basically had to write a treatise on why games aren’t just TV with controllers and actually exercise your brain in certain ways. Yes, this treatise was created for the sake of a game console, but I stick by it to this day, and it was my love of strange, beautiful games that got me into coding (I wanted to make my own). The first game-building framework I messed…

Anahit Gulian

Software engineer ^__^ NYC

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store