## 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 find memory leak using valgrind memory debugging tool

In this blog we are going to discuss “How to find memory leak using valgrind memory debugging tool”. In previous blog http://wikistack.com/how-to-write-c-program-for-trie-data-structure/ we have implemented trie data structure with...

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

## C program to calculate maximum depth or height of a binary tree

The maximum depth or height of a binary is the number of nodes from root node to its farthest or deepest leaf node. For example the below binary tree...

## implement stack using array in c

implement stack using array in c. A stack is a data structure where the addition of new items and the removal of existing items always takes place at the...

## Binary search tree

A binary tree where the left child contains only nodes with values less than the parent node, and where the right child only contains nodes with values greater than...

## Introduction to singly link list

Introduction to singly Link List: There are various linked list data structure in computer science which are used to store data. the data is grouped with the address of...

## introduction to tree data structure

What is tree data structure. In computer science tree data structure is a data storage mechanism in which each node points to different nodes in tree like structure. “Trees...

## Trie Data Structure Introduction implementation and application

In this blog post we are going to learn trie Data Structure Introduction implementation and application. What is it? We are assuming that readers of this article is familiar...