Constructing a Binary Tree from Traversal Results

We can construct a binary tree if we are given at least two traversal results. The first traversal must be the in-order traversal and the second can be either pre-order or post-order traversal.

Read More →

C program to Convert Decimal number into Binary using Stack

A stack is a linear data structure and follows the last in first out rule, in this tutorial, we will learn how to convert a decimal number into binary using stack.

Read More →

C program for Sorting Linked List

In this article, we will see how to sort the elements of a linked list in a particular order, for sorting we are going to use the bubble sorting technique.

Read More →

C Program to Delete a Node from Linked List

Learn how to create a program to delete a node from a linked list. We can delete a node from Linked List by using three methods deleting the first node, deleting the last node and deleting the intermediate node

Read More →

Understanding the Concepts of Linked List-The Easy Way

When we want to store multiple values without using multiple variables we make use of arrays, but while using arrays we have the knowledge of the size of data that we are going to store, what if we do not know, the answer is dynamic data structures.

Read More →

C program to perform implementation of Linked List

Linked List is an Example of dynamic data structure, they are  not required to be stored  in adjacent memory locations, Each structure of the linked list consists of data field and address field which holds the address of its successor.

Read More →
Search
Adverstisement
Adverstisement