Articles in this series
Assalam u Alaikum & Hello everyone! 👋 In the previous article, we learned about Tree Traversals and how to traverse a tree using the Depth First Search (DFS) Technique. We also learned the three techniques (Pre Order, In Order & Post Order) which we...
Assalam u Alaikum & Hello everyone! 👋 In the previous article, we learned about Binary Search Trees. In this article, we will learn how we can traverse a tree using the DFS technique. Prerequisite 1. Recursion Traversing a tree requires a good under...
Assalam u Alaikum & hello everyone! 👋🏻✨ I hope you all are doing well. In the previous post about the Introduction To Trees, we learned what are trees, different types of trees and finally, we implemented a simple general tree using JavaScript. In ...
Hello everyone! 👋🏻 Hope you all are good ✨ Today, we are going to learn another useful data structure i.e Trees 🚀 Trees A tree is a data structure where a node can have zero or more children nodes. Each node contains a value, and similar to graphs...
✨ Introduction Breadth First Search AKA BFS and Depth First Search AKA DFS are two graph searching algorithms. There are many other searching algorithms as well but these two are the simplest ones. If you have studied the Tree data structure ever bef...
Hello everyone! 👋🏻 Welcome back to another post in Data Structures 101 Series 🥷 In the previous post, we learned what is a graph data structure, applications of graphs, and ways of implementing the graphs. We learned that we can implement graphs ...
