This situation is called Stack Overflow.Īns) i) Stacks are used to convert Infix expression into Postfix. This situation is called Stack Underflow.Īns) If Stack is full and PUSH operation is performed it is not possible to insert or Push the It is also called as LIFO list.(Last In FirstĪns) Is Stack is empty and POP operation is performed it is not possible to delete the items. Only one end called as “Top” of the Stack. Linked list (traversing can be done in both directions).ĦQ) What is a Stack? (LIFO Data Structure)Īns) Stack is an ordered collection of items into which items can be inserted and deleted from Successor and another to its predecessor (previous element).It is also called as two way List is called as head and a pointer to the last element of the list is called as tail used toĪns) In Doubly Linked List each element contains two pointers: One Pointer points to its Linear if it is attach with many of the items in specific ways to reflect relationship.]Īns) Singly Linked List is a Sequence of dynamically allocated Storage elements, eachĮlement of which contains a pointer to its successor. [A data structure is linear if every item is related with next and previous item and it is non Several other data items in a way that is specific for reflecting relationships. It does not maintain any linear relationship between their elements. Non Linear Data Structures: A data structure is said to be non-linear if elements do not In linear data structure we can not insert an item in middle place and it maintains a linearĮgs: Array, Linked list, Stack, Queue, Dequeue etc. It is sequential and continues in nature i. Linear Data Structures: A data structure is said to be linear if the elements form a Instances & among the individual elements that compose an instance.ĢQ) Types of Data Structures and give examples?Īns) There are two types of Data Structures:
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |