Tree data structure in JavaScript
Implementation and traversal techniques
Series
Basics to advanced: Tree data structure in JS
Posts in this series
Tree: efficient traversal with parent pointer
In the first part of this series we looked at recursive and iterative approaches for traversing through a binary tree. If you haven't looked through it yet, I highly recommend you to check it out first. I'll wait here, I promise ;) In real life app...
Applying tree traversal algorithms to DOM
We've looked through few binary tree traversal techniques so far: 1- Traversing through the binary tree using recursive and iterative algorithms 2- Traversing through the binary tree using parent pointers In this article, we'll put those learnings to...
Trie in Javascript: the Data Structure behind Autocomplete
We've already covered the basics of tree data structure in three posts. If you haven't gone through those yet, I would strongly going through the introductory post at the very least. Introduction Trie is a variation of tree data structure. It's also ...
Heaps in JavaScript
So far we've looked at implementation of tree data structure and some of it's variants such as trie. In this post, we'll dive into heaps. These are also referred to as priority queues. Introduction Heap is a variant of tree data structure, with two a...
