DATASTRUCTURES
DataStructures: a) Data structures are formats used to organize, store and manage data efficiently. e.g. stacks , queues , singly-linked lists , doubly linked lists , binary search trees , hashing and heaps . b) Operations on data structures are searching , sorting , adding , updating and deleting . c) A linked list is a linear data structure where the elements are not stored at the contiguous memory locations, they are stored dynamically. d) It has a collection of nodes where each node consists of two members which represents its value and a next/previous pointer which stores the address for the next/previous node. e) Stacks, Queues, Singly-linked lists, Doubly linked lists, Binary Search Trees can be implemented as linked lists. Stack: a) Stack follows LIFO(Last In First Out) principle . b) It is used in function calls. c) The functions of Stack are push(Adds an element) and pop(Extracts an element). d) It has a TOP pointer . Ex...