Summary

In this chapter, we discussed the non-linear data structure in detail. You learned that trees are hierarchical data structures and that there are different tree types, operations, and complexities. We have also seen how to define a binary search tree. This will be very useful for implementing different searching techniques and data storage. In our next chapter, we will shift our focus from data structures to algorithms. We will focus on the first type of algorithm--the sorting algorithms.