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
# Algorithms

This category contains all the posts related to Algorithms. For e.g.: Sorting, Hashing, Searching, Tree Traversals, Graph Theory etc.

## 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
## Dynamic Programming – Distinct Paths between two points

Introduction
This is the second post in Dynamic Programming - Online Classes.
This is another article which demonstrates the usage of dynamic programming to solve a different problem in hand. To learn the basics of dynamic programming check my first article on dynamic programming.
Purpose of the article
The purpose of this article is to solve another problem using dynamic programming, this is another very famous interview question which is asked in multiple interviews. So without wasting any time, let us jump into the problem and ways to solve the same.
Count the number of distinct path...

Read More
## Dynamic Programming – Longest Common Subsequence

[nextpage title="Introduction"]
This is the first post in Dynamic Programming - Online Classes.
Dynamic programming have been a very interesting topic and technique to solve problems which exhibit a specific set of behaviors. We will try to understand the behaviors and the way it can be implemented to solve complex problem without requiring a mathematical approach. We will try to simplify it to make it clearly understandable and in later articles we will pick up two or three problem statements which can be easily solved using Dynamic Programming.
Purpose of the article
The purpose of thi...

Read More
## Hierarchical Datastructure – Iterative Tree Traversals

[nextpage title="Introduction"]
This is the second article in the Tree Traversals - Online Classes.
This is the sixth 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
We are already done with the constructing a binary tree and doing basic operations like creating a tree, adding a node, removing a node and all the traversals. There are situations when we...

Read More
## Hierarchical Datastructure – Adding and Deleting Nodes

Introduction
This is the fifth 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
Now that we have done a lot of base building and hard work, I decide to keep this an easy one for the readers. Also, we are not left with many concepts, they are already covered in the articles listed below:
Hierarchical Datastructure – detailed discussion
Hierarchical Da...

Read More
## Hierarchical Datastructure – Tree Traversals

Introduction
This is the first article in the Tree Traversals - Online Classes.
To read more about the previous article, please check the topic Hierarchical Datastructure – Binary Tree Implementation. To get updates on the other articles in the series, please use the Subscribe feature on the right panel.
Purpose of article
This article will take over from where we wrapped up in the last article, It will define the remaining two methods elements() and positions() of the Tree ADT for LinkedBinaryTree. And we will also discuss the Tree traversals and code for the Binary Tree. We will finish...

Read More