In the previous chapter, we discussed using a string as a non-linear data structure and tried to construct, use, and solve several problems in the string data type. In this chapter, we are going to discuss another non-linear data structure, which is a tree that stores data in a hierarchical form.
In this chapter, we are going to discuss the following topics:
- Introducing the tree data structure
- Understanding the binary search tree
- Balancing the binary search tree
- Implementing the priority queue using a binary heap
