dsa

Operations on a binary tree – Hierarchical Datastructure

Introduction This is the eighth article in the series of non-linear data structures, to read more about the previous article, please check the topic Binary Tree – Print all paths in a tree. To get updates on the coming articles in the series, please use the Subscribe feature on the right panel. Purpose of article This article is mostly about operations on a binary tree, writing code to delete a binary tree, mirror a binary tree, finding the height of a node and finding the depth of a node. We will use the same tree which we have used till now for all these operations. The tree is shown belo...
Read More

Binary Tree – Print all paths in a tree

Introduction This is the seventh article in the series of non-linear data structures, to read more about the previous article, please check the topic Hierarchical Datastructure – Tree Traversals. To get updates on the coming articles in the series, please use the Subscribe feature on the right panel. Purpose of article This article is mostly about using our knowledge of tree to find out ways to solve real world problems and also perform some operations on the tree. We visit the problem to Print all paths in a tree. Common Operations on a Tree Here we assume that we already have a tree bui...
Read More

Hierarchical Datastructure – Binary Tree Implementation

Introduction This is the third article in the series of non-linear data structures, to read more about the previous article, please check the topic HIERARCHICAL DATA STRUCTURE – TREE ADT. People might feel that the pace with which we are progressing is too slow, but I woul dlike to assure you that these are the articles which are the roots of the non-linear data structures, if we do not spend enough time on these, we might face bigger challenegs later. To get updates on the other articles in the series, please use the Subscribe feature on the right panel. Purpose of article This article wil...
Read More