In this tutorial, we will see another Sorting technique which is Quick sort and Quick Sort Program in C. Quick sort: Quick sort is the fastest internal sorting algorithm without any additional memory for sorting data. In quick sort, first, we choose the key element in the list which is called Pivot element. Then we […]

## B tree in data structure

B tree in data structure is another type of tree data structure. It is also called as multiway search tree. In this tutorial we will see B tree definition, B tree properties and B tree program in c. B tree Definition In External searching out aim is to minimize the file access and this can be done […]

## Graph in data structure

Graph in data structure is another most important concept in data structure. In this tutorial we will see what is graph in data structure, Graph definition, types of graphs and graph traversal techniques. What is graph in data structure ? Graph definition in data structure : A graph is a set of vertices (v) bad […]

## Tree traversal in data structure

Tree traversal in data structure is methods to visit or traverse the tree. In previous tutorial we seen basic concept of tree that is what is tree in data structure, tree terminology and types of tree. Now in this tutorial we will see how to traverse the tree in data structure. tree traversal in data […]

## Tree in data structure tutorial

Tree in data structure tutorial is very important concept in data structure. In this tutorial we are going to see tree in data structure, tree in data structure definition, and tree terminology. What is tree in data structure ? Tree in data structure definition : Tree is finite set of nodes with one specially designed node […]

- 1
- 2
- 3
- …
- 5
- Next Page »