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

What is it? We are assuming that readers of this article is familiar with tree data structure. A Trie is a special type of tree where each vertex represents...