Author name: Abhay

In this tutorial, you will learn an important data structure, Graph. You will also discover basic terminology, types of graphs, how graphs are represented in memory and their applications. A graph is a non-linear data structure consisting of vertices and edges that connect these vertices. Definition A graph is an ordered set G = (V, […]

An expression tree is a special type of binary tree that is used to store algebraic expressions. In an expression tree, each internal node corresponds to the operator and each leaf node corresponds to the operand. Consider the algebraic expression given as: X = (a + b) – (c * d). This can be represented

In this tutorial, you will learn what is a binary search tree, how different operations like insertion, deletion, searching are done in a binary search tree with examples in C and what are the applications of binary search trees. A Binary Search Tree is a special binary tree used for the efficient storage of data.

In this tutorial, you will learn the implementation of different tree traversal algorithms, which were specified recursively in the last tutorial, by means of non-recursive procedures using stacks. Pre-order Traversal Without Recursion The following operations are performed to traverse a binary tree in pre-order using a stack: Start with root node and push onto stack.

This tutorial discusses different ways for traversing a binary tree (pre-order, post-order, in-order) with algorithms. Binary Tree Traversal A binary tree can be traversed in three different ways, namely, pre-order, post-order and in-order. The order in which the nodes are visited differs between these techniques. In-order Traversal of Binary Tree The following operations are done