In this chapter, we covered the algorithms to add, search, and remove items from a binary search tree, which is the basic tree data structure largely used in Computer Science. We also covered three traversal approaches to visit all the nodes of a tree.

In the next chapter, we will study the basic concepts of graphs, which is also a non linear data structure.