Data structures – Stack ADT: A stack is a linear data structure which follows LIFO (Last in first out) principle, in which both insertion and deletion occur at only one end of the list called the TOP. OPERATIONS ON STACK : The fundamental operations performed on stack are : Push (insertion) Pop (deletion) The push […]

## Data structures: Applications of Linked List

Linked List applications: Advantages and disadvantages, clear-cut explanations about “Applications of Linked List” in Data structures. APLLICATIONS OF LINKED LIST Radix sort Multilist Polynomial ADT Radix sort: Radix sort is the generalized form of bucket sort. It can be performed by using buckets 0 to 9. In first pass, all the elements are sorted according […]

## Data structures: Binary tree Questions and Answers

Binary tree important questions and answers in “Data structures.” These 2 mark Q & A will be used by Engineering stream and all kind of computer related students. BINARY TREE 1. Define a binary tree. A binary tree is a tree which has nodes either empty or not more than two child nodes, each of […]

## Data structures: Linear structures questions and answers

Data structures important questions and answers: This section covers the “Linear structures”. Simple exam questions are given with the decent solutions. It can be used for Engineering CSE or IT students and all computer related students. Linear structures Small Q&A’s: 2 Marks 1) What is a data structure? Data structure is a way of organizing, […]