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 of Tree Tree is also known as General Tree. Terminology Root: Nodes that have no parent is called Root Node. They are at the top position in the tree. Parent Node : Nodes that are represented at the tail of an arrow is called Parent Node. Child Node : Read more…