Arrays are easy just add square brackets and you get an array. At Least easier than array using linked lists anyways, In this tutorial we will learn how to find out the largest and smallest element of an array by making a C program.
- 23 February 2017
- Danish A.Khan
Most of us have done a lot of C programs using recursion and Recursion is the only thing in programming which gives me nightmares but anyways today we will see another C program which we can make using recursion.
A priority queue can be thought of as a modified queue in which when an element has to be removed from the queue, the one with the highest priority is retrieved first. The priority of the element can be set based on various factors.
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.
- 06 December 2016
- Mohd Shibli
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.
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.
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