Q) What is a Data Structure?
- A data structure is a way of organizing the data so that the data can be used efficiently.
- Different kinds of data structures are suitable to different kinds of applications.
- Example- compiler usually use hash tables to look up identifiers.
Q) What is a linear and non-linear data structure?
- Linear:
- A data structure is said to be linear if its elements from a sequence or a linear list
- Example- Array, Linked list.
- Non-linear:
- A data structure is said to be non-linear if the traversal of nodes is nonlinear in nature.
- Example- Graphs and Trees.
Q) What is a Linked List and What are its types?
- A linked list is a linear data staructure (like arrays) where each element is a separate object.
- Each element (that is node) of a list is comprising of two items- the data and a reference to the next node.
- Types of Linked List:
- Singly Linked List:
- Every node stores address or reference of next node in list and the last node has next address or reference as NULL.
- Example 1->2->3->4->NULL.
- Doubly Linked List:
- Two references associated with each node, One of the reference points to the next node and one to the previous node.
- Example NULL<-1<->2<->3->NULL.
- Circular Linked List:
- All nodes are connected to form a cirle. There is no NULL at the end.
- A circular linked list can be a singly circular linked list or doubly circular linked list.
- Example 1->2->3->1[The next pointer of last node is pointing to the first]
Note:
Hello Guys, Don't Stop Learning keep Going..............