TIL AVL Tree

May 29th, 2018 #TIL, Data Structures & Algorithms Kerry 1 min read

AVL (2 scientist guys’ last names: Adelson-Velsky and Landis) Tree is a special BST (binary search tree). It solves the problem of a BST becoming unbalanced, which at its extreme, results in a linked list. It achieves this by recursively asking “Am I balanced?” after a new node is added. If the answer is “NO!” then single or double rotations need to occur depending on…

TIL Bloom Filter

May 20th, 2018 #TIL, Data Structures & Algorithms, JavaScript Kerry 1 min read

Refreshing some computer science concepts by taking Brian Holt’s course on FrontendMasters.com. The first part lesson was on Bloom Filter’s, which sounded complicated and scary. The concept ended up being easy to grasp and he presents a great example of a practical application. The devil is obviously in the details but knowing a tool exists and the reasons to use it is always a step…

Trie Harder

Feb 4th, 2017 Data Structures & Algorithms, JavaScript Kerry 7 min read

Whether your resolution was to go to the gym three times a week or write a blog post once per week, they usually all end in the same: Broken. It’s not that I haven’t been coding or continuing to learn. I’ve done a lot of coding at work these days using Phaser and solving puzzles over at CodinGame and FreeCodeCamp. Writing doesn’t quite ignite my soul the…