Table of Contents 📚 Introduction to Tree Traversals Traversal is a fundamental operation in which we visit all the nodes of a tree and perform some operation (such as a print operation) at each node. In this post, we’ll discuss three commonly used traversals for binary trees: in-order, pre-order, and post-order. In-order Traversal In in-order […]
Table of Contents 📚 Introduction to Breadth-First Search 🌱 Breadth-First Search (BFS) is a traversal algorithm used for both trees and graphs. The algorithm starts from the root node (in a tree) or any arbitrary node (in a graph) and explores all its neighbors at the present depth before moving on to nodes at the
Breadth-First Search Read More »
Table of Contents 📚 Introduction to Depth-First Search 🌱 Depth-First Search (DFS) is an algorithm for traversing trees and graphs. The idea is to start from the root (in case of a tree) or any arbitrary node (in case of a graph), mark the node, and move to an adjacent unmarked node and continue this
Depth-First Search Read More »
A Binary Tree is a type of tree data structure in which each node has at most two children, commonly referred to as the “left child” and the “right child.” Java Implementation Below is a Java implementation of a simple binary tree with basic functionalities such as adding nodes and traversing the tree. Binary Trees
What is a Tree? A Tree is a hierarchical data structure composed of nodes connected by edges. It has a root node and zero or more subtrees, each with its own subtree structure. Unlike arrays or linked lists, trees are non-linear, offering a more diversified set of use-cases. Structure of a Tree Example: Types of