data structures and algorithms

Dynamic Programming – Longest Common Subsequence

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 this article is to enable the read...
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

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