https://ohnickmoy.com/Nick's developer blog and project website. 2026-09-16T11:18:25-04:00 Nick https://ohnickmoy.com/ Jekyll © 2026 Nick /assets/img/favicons/favicon.ico /assets/img/favicons/favicon-96x96.png 2020-12-18T16:07:52-05:00 2020-12-18T16:07:52-05:00 https://ohnickmoy.com/testing-code-a-good-practice-to-have/ {"display_name"=>"Nicholas Moy", "login"=>"Nick", "email"=>"nicksmoy@gmail.com", "url"=>""}

Testing my code was drilled into my brain when I was working at edX. For each monitoring script I wrote, there was an accompanying test script to make sure that it worked. Prior to edX, I admittedly did not write tests for my code to make sure it worked. I just relied on good ol' pencil and paper, have a list of what I wanted to check, and manually test code for outcomes. So write code, have...

2020-08-19T00:02:08-04:00 2020-08-19T00:02:08-04:00 https://ohnickmoy.com/summer-at-edx/ {"display_name"=>"Nicholas Moy", "login"=>"Nick", "email"=>"nicksmoy@gmail.com", "url"=>""}

edX is a massive open online course (MOOC) provider based out of Boston, MA and it was the place of my internship for the summer as I start my career as a software engineer. I opted to be part of the Site Reliability Engineering team for the summer and suffice to say, I learned A LOT during my 3 months with them. The interest in DevOps and SRE Back when I was still at Flatiron School, I ha...

2020-05-10T22:33:57-04:00 2020-05-10T22:33:57-04:00 https://ohnickmoy.com/discovering-data-structures-binary-tree-traversal/ {"display_name"=>"Nicholas Moy", "login"=>"Nick", "email"=>"nicksmoy@gmail.com", "url"=>""}

Let's find our way through the forest In our last couple of posts, we talked about two things: the implementation of binary trees and recursion. First, we know that binary trees consist of a root node, that points to its own children, which then points to its own subsequent children. Second, we know that recursion is the process in which a function calls itself directly or indirectly. With ...

2020-05-02T23:25:05-04:00 2020-05-02T23:25:05-04:00 https://ohnickmoy.com/algorithm-concepts-recursion/ {"display_name"=>"Nicholas Moy", "login"=>"Nick", "email"=>"nicksmoy@gmail.com", "url"=>""}

Before getting into how to traverse binary trees, whether ordered or unordered, as mentioned in my last post, we have to go into recursion, since it's an integral part of how to do that, which brings me to the creation of a new series: Algorithm Concepts. This series that'll show up from time to time will probably cover things like Big O or searching algorithms. On with the show! Yes. Get o...

2020-04-25T19:58:05-04:00 2020-04-25T19:58:05-04:00 https://ohnickmoy.com/discovering-data-structures-binary-tree-implementation/ {"display_name"=>"Nicholas Moy", "login"=>"Nick", "email"=>"nicksmoy@gmail.com", "url"=>""}

Split that branch in two! In my last post, we talked about the binary search tree, what it is, and it's use cases. Now, we're going to talk about implementation. Since I've been working in JavaScript as of late, we're going to use JavaScript to code it. Here. We. Go. Implementation of the base classes There are two main classes for the Binary search tree, and that's the Tree class and ...