Blog

DOS

LINKS FOR MORE DOS TRICKS History DOS (Disk Operating System) was developed by Microsoft Inc. and released it as IBM PC DOS (known as MS-DOS) for the first time on August 21, 1981, as MS-DOS 1.0, which was written by Tim …

Shortest Path Problem

Introduction In graph theory, the shortest path problem is the problem of finding a path between two vertices/nodes (as source and destination) in a graph such that the sum of the weights/costs of its constituent edges route is minimized. The shortest path problem is considered as – The single-pair shortest path …

Minimum Cost Spanning Tree

Introduction of Minimum Cost Spanning Tree The minimum (Cost) Spanning Tree is also known as MST. Definition of MST A Minimum Cost Spanning Tree is a way of connecting all the points (or nodes) in a network with the least …

Representation of Graph

Introduction of Representation of Graph Graphs are believed to be a way of expressing relationships between pairs of items and are one of the most important abstractions in computer science. Definition The representation of a graph is a way to …

Traversal in Graph

Introduction of Traversal in Graph Traversal means the act or process of passing across, over, touching, or through and doing something with the data. A graph traversal technique visits every node exactly once in a systematic fashion. Definition Graph traversal …

Splay Tree

Introduction The splay tree was introduced by Daniel Sleator and Robert Tarjan in 1985. Splay trees perform a splay operation, which is a combination of rotations and reorganizations, to move the accessed element to the root. Definition A splay tree …

Red-Black Tree

Introduction of Red-Black Tree The red-Black tree is advanced and is a modified form of the Binary Search Tree. Definition A red-black tree is a self-balancing binary search tree that maintains balanced properties through the use of color annotations on …

AVL Tree

Introduction of AVL Tree The AVL tree is named after its two Soviet Union inventors, Georgy Adelson-Velsky and Evgenii Landis, who published it in their paper “An algorithm for the organization of information” in 1962. The AVL tree is also called a Self-balancing BST. Definition …

Binary Search Tree

Introduction of Binary Search Tree They are also called Ordered Binary Trees, as each node in a BST is placed according to a specific order. Definition A binary search tree is a non-linear, non-cyclic data structure and is an extension/type …

Binary Tree

Introduction Binary Tree is considered as the mother tree because most of the trees are derived from this tree. Definition A binary tree is a type of tree in which no node can have more than two children is called a binary …

Subscribe to our Newsletter