## What is Data Structure and Abstract Data Types?

• June 29, 2020

The study of data structure, therefore, involves two complementary goals. The first goal is to identify and develop useful mathematical entities and operations. The second goal is to determine representations for those abstract entities and to implement the abstract operations. In data structures that exist in c, the array, and structure, we describe the facilities […]

## How to Represent Stack in C – Data Structure

• June 22, 2020

The stack provides for the insertion and deletion of items, so that a stack is a dynamic, constantly changing object. Before that, you must know what is data structure? #define MAXSIZE 100struct stack {int items[MAXSIZE];int top;}; Note: If the value of s-top is 4 there are five elements on the stack i.e s.item[0], s.items[1], s.items[2], […]

## Tower of Hanoi Problem (TOH) with Recursive Algorithm

• June 14, 2020

TOH ( Tower of Hanoi) is a mathematical game or puzzle. It consists of 3 pegs A, B, and C. N Disks of different diameters are placed on peg A so that a larger disk is always below a smaller disk. The aim is to move the N disks to peg C using peg B […]

## Non-Linear Data Structure and Algorithm

• May 24, 2020

The implementations of Stacks and Queues from linear data structures.  They cannot represent data items possessing hierarchical relationships such as between the grandfather and his descendants and in turn their descendants and so on. We need a non-linear data structure to deal with such an application in a real-life situation. Trees and graphs are two […]

## Binary Trees and It’s Different Types

• May 23, 2020

A binary tree is a finite set of elements that is either empty or is partitioned into three disjoint subsets. The first subset contains a single element called the root of the tree. The other two subsets are themselves binary trees, called the left and right subtrees of the original tree. Left or right subtree […]

## What is Data Structure? Why Do We Require This?

• July 28, 2019