About DSA
The data structure is a representation of the logical relationship existing between individual elements of data. In other words, a data structure defines a way of organizing all data items that consider not only the elements stored but also their relationship to each other. The term data structure is used to describe the way data is stored. To develop a program of an algorithm we should select an appropriate data structure for that algorithm. Therefore, the data structure is represented as:
Algorithm + Data structure = Program
Send download link to:
A data structure is said to be linear if its elements form a sequence or a linear list. The linear data structures like an arrays, stacks, queues, and linked lists organize data in linear order. A data structure is said to be nonlinear if its elements form a hierarchical classification where data items appear at various levels.
Trees and Graphs are widely used non-linear data structures. Tree and graph structures represent hierarchical relationships between individual data elements. Graphs are nothing but trees with certain restrictions removed.