Chapter 4. Using Trees for Faster Lookup and Modifications
Treesare one of the most advanced and complex data structures out there. It opens doors to graph theory, which is used to represent a relationship between objects. The objects can be of any type, and as long as they have an established relationship, it can be represented in the form of a tree.
Although there are tens of trees out there, it is not possible to cover them all in the chapter, so we will take a different approach and learn about trees in a more practical way when we go through the examples, instead of doing it upfront like in previous chapters.
In this chapter, we will be exploring the following topics:
- Creating a base angular application,
- Creating a typeahead lookup component using trie trees
- Creating a credit card approval predictor using the ID3 algorithm.
So, let's dig into it.
