Theory

Data Structure:
                        Data structure is a collection of basic data types combined according to the rules of programming language to create a new user defined data type.

Types of Data Structure:
  • Linear Data Structure 
  • Non-Linear Data Structure
Linear Data Structure: 
                                      The data structure whose elements are organized in a sequence is called linear data structure.
For example: Arrays,Link list, Ques and Stacks.

Non-Linear Data Structure:
                                             The data structure whose elements are arranged in non-linear or non sequence form is called non linear data structure.
For example: Trees and Graphs


Operations on Data Structure:
  • Inserting
  • Deleting
  • Searching
  • Trans-versing
  • Sorting
Inserting: 
Adding new data items into a data structure is called inserting.
 
Deleting:
Removing data items from a data structure is called deleting.

Searching:
Finding specific data items from data structure is called searching.
Trans-versing:
Accessing each data item in a data structure al least once is called trans-versing.
Sorting:
Arranging data items in a data structure into a specific order is called sorting.

2 comments:

Tree Insertion

#include <iostream> using namespace std; struct node {     int data;     node*left;     node* right; }; class tree { priva...