## Binary tree inorder traversal without recursion using stack

In this blog we are going to discuss how to implement binary tree inorder traversal without recursion using stack. How to approach solution for Binary tree inorder traversal without...

## Print all nodes of the same level from binary tree

Print all nodes of the same level from binary tree. For example the output for the below binary tree is 6,8,5,8,3. C++ Print all nodes of the same level...

## C program to count size of binary tree

Given a binary tree write a C program to count size of binary tree. For example the size of binary tree is 4 in below binary tree. (3) /...

## c program to print linked list in reverse order

Write c program to print linked list in reverse order. This very simple linked list interview questions for the beginners. you have to reverse the sequence only. So it...

## how to count the number of nodes in a linked list

In this blog post we will learn how to count the number of nodes in a linked list using c/ c++ program. to count linked list nodes we have...

## how to write c program for avl tree data structure

In this tutorial blog we will see how to write c program for avl tree data structure. what is avl tree? avl tree is self balancing binary search tree...

## c program to find maximum path sum in binary tree

Write a c program to find maximum path sum in binary tree. The path may starts at any node and end at any other node in the given binary...

## C program to find maximum sum from root to leaf in a binary tree

Given a binary tree write a c program to find maximum sum from root to leaf in a binary tree. For example if given binary tree is as below...

## how to write c program for trie data structure

In this blog we will learn how to write c program for trie data structure. Trie is one useful data structure which is used in memory constraint system. we...

## shortest path problem dijkstra’s algorithm

shortest path problem Shortest path problem can be defined as a problem to find minimum distance between two vertices/nodes of connected weighted graph.Dijkstra’s algorithm is an efficient algorithm for...