Data Structure definition & Classification

Data Structure definition & Classification

1. Definition

   • Organized collection of data
   • Helps a program to access data efficiently and rapidly

2. Classification

   • Linear
     • static
       • array
         • Sequential collection of elements of the same type
         • Each element of the array can be accessed using its position
     • dynamic
       • linkedList
         • Collection of nodes
         • Each node contains the data element and a pointer to the next node
       • stack
         • Linear data structure
         • Elements can be added or removed only from one end
       • queue
         • Linear data structure
         • Elements are added at one end called “rear” and deleted from another end called “front”
   • Non-linear
     • trees
       • Hierarchical relationship between the elements
       • Elements of the tree are called Nodes.
       • Node at the top is called the root
       • Root can have one or more child nodes
     • graphs
       • Set of nodes called vertices connected to each other
       • Connected by links called Edges
       • Graphs can have a cycle inside it

Images and files in the map