Data Structures in C
Learning the Data strucures in C will help the students to design different data structures as well as their progrmming skill will get improved .
Pointers
The concept of pointers is one of the most powerful fundamentals of C/C++ language.
Through pointers a developer can directly access memory from his/her code which makes memory related operations very fast. But, as always, with great power comes great responsibility.
Arrays
An array is a collection of same type of elements which are sheltered under a common name.
An array can be visualised as a row in a table, whose each successive block can be thought of as memory bytes containing one element.
Stacks and Queues
Stacks and queues are temporally ordered container types. Elements are removed in an order based upon the order in which they were added.
-
Stacks remove the last element added first. They use a LIFO (Last in First out) ordering.
-
Queues remove the first element added first. They use a FIFO (First in First out) ordering.
Trees
A tree is a widely used abstract data type (ADT) or data structure implementing this ADT that simulates a hierarchical tree structure, with a root value and subtrees of children with a parent node, represented as a set of linked nodes.
Graphs
A graph is an abstract data type that is meant to implement the graph and directed graph concepts from mathematics.
A graph data structure consists of a finite (and possibly mutable) set of nodes or vertices, together with a set of ordered pairs of these nodes (or, in some cases, a set of unordered pairs).