Blog

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 …

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 …

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 …

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 …

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 …