Internet Academy

B Tree in DSA Introduction B tree  is a self balancing tree which can have two or more than two child nodes. Elements in the nodes are sorted in order…

Graph in Data Structure Introduction Graph is a collection of nodes (vertices) and edges. Edge is a pair of vertices, if u and v are two vertices of…

Binary Search Tree Tree Tree is a non-linear data structure. Data is stored in nodes of the tree. A node of a tree can have 0, 1, 2 or more children. …

Heap Tree and Heap Sort Introduction A heap is a binary tree with a key value in each node satisfying following properties: All the leaves of the heap…

Algorithm Analysis in DSA   Algorithm Analysis Algorithm Analysis means to calculate time and space required by the algorithm to execute. A simple e…

Sorting and Its types with Examples Sorting is a method of arranging data in either increasing order or decreasing order. Several sorting algorithms a…