9.0 Data Structures – Advanced Lists .. Part-2

Let's continue talking about Lists, but first let's have a quick recap. In the last post, we covered a new way to implement lists, which is using recursion. To use this technique, we changed the underlying data members. In this post, we are continuing with another version of lists, Circular Lists. The idea behind circular … Continue reading 9.0 Data Structures – Advanced Lists .. Part-2

7.0 Data Structures – Binary Search Trees

A tree is a data structure that has many variants.  From our human perceptive, trees have too many branches and leafs. They are very useful in sunny days, where we walk under their shadows. In Computer Science world, they have another usage. We use their leafs to store data. Yes!! their leafs are a place where we can … Continue reading 7.0 Data Structures – Binary Search Trees