7
Variants of Trees
In the previous chapters, you learned about many data structures, starting with simple ones such as arrays. Now, it is time for you to get to know a significantly more complex group of data structures, namely trees.
At the beginning of this chapter, a basic tree will be presented, together with its implementation in the C# language, and with some examples showing it in action. Then, a binary tree will be introduced, with a detailed description of its implementation and an example of its application. A binary search tree (BST) is another tree variant and is one of the most popular types of trees, used in many algorithms. You will also cover self-balancing trees, namely AVL and red-black trees (RBTs). Then, you will see a ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access