Evaluation of Arithmetic Expression An important application of stack is the compilation of arithmetic stack expressions in the programming languages. The compiler must be able to translate the expression which is written in the usual notation known as infix notation to form a reverse polish notation. compiler accomplish this task […]
B-Tree M-way tree provides the shorter search path lengths as compared to binary tree. A very important category of m-way trees is B-tree which was introduced by R.Bayer and E. Mc Greight in year 1970’s. Faster access to the data set is very important if the data set contains a […]
INTRODUCTION TO STACK Stack is one of the most commonly used linear data structure of variable size. In linear data structure discussed so far i.e array , insertion and deletion of an element can take place at any position of the array but in case of stack, the insertion and […]
Splay tree: Splay tree is very efficient tree . Splay Tree is like Binary Search Tree. It is also a self – adjusted tree in which every operation on an element rearrange the tree so that the element is placed at the root position of the tree. Splay tree operations take […]
Graph- Introduction A Graph is a data structure consisting of vertices and edges. the theory associated with graph is called graph theory. It can be used to solve many problems such as Planning routes for goods or services delivery, finding the shortest path, finding number of colours needed to colour […]
Concept of Data Structure A data type can be defined as set of values and set of operations which are permissible on those values. For example, an integer data type in C language can have range ( -32768 to 32767) and set of operations +, – , * , […]
BINARY TREE An important category of general tree is Binary Tree. A binary tree can be defined as a finite collection of nodes where each node is having the property that it can have 0,1 or 2 children. A binary tree may be empty known as Null tree or […]
TREE A tree t can be a defined as finite(means limit or not infinite) set of nodes in which there is one specially designated node known as root of the tree. and the remaining nodes are partitioned into disjoint sets t1, t2….tn such that each t1 is itself a tree […]
INTRODUCTION TO DATA STRUCTURE A data structure is a way of storing the data in computer’s memory so that it can be used efficiently. Formally, a data structure is a logical or mathematical model of organization of data. The choice of data structure begins with the choice of an Abstract […]
