Introduction of Minimum Cost Spanning Tree The minimum (Cost) Spanning Tree is also known as MST. Definition of MST A Spanning Tree (ST) is (actually derived from a graph) a tree (a connected graph without a cycle) that contains all the vertices of the graph. In other words, ST is Read more…
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 store graphical format inside the computer’s memory in the binary Read more…
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 is a process for accessing/searching all the vertices data values Read more…
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 is a self-adjusting binary search tree data structure that provides Read more…
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 its nodes i.e. every node is colored with either red Read more…
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 Self Balancing BST. Tree Rotation : Tree rotation is an operation performed on an Read more…
Introduction of Binary Search Tree They are also called Ordered Binary Trees as each node in 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 of binary tree that may be empty, or each node has Read more…
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 tree. A tree is a finite set of nodes storing Read more…
Introduction The evolution of operating systems (OS) can be traced back to the early days of computing when the first computers were designed for specific purposes and were operated by engineers and technicians. The evolution of operating systems (OS) can be traced back to the 1950s when the first mainframe Read more…
Standard/Communication Standard A standard is a set of specifications(guidelines) for hardware or software used in the making of products, agreed upon by a national or international authority or recognised body or by general consent or academic body or industry group etc. A standard is accepted or followed by most of the Read more…