AVL trees named after three inventors Adelson-Velsky-and Landis, is a type of self balancing binary search tree.
1 Comment
October 2, 2021
A balanced binary tree or a height-balanced tree is a tree in which the height of the left and right subtree at any node does not differ by more than one. Not just the root node, at any node. Mathematically we define using a balanced factor.
September 28, 2021
Trie, also known as prefix tree or digital tree, is an advanced tree data structure that makes data retrieval operations more efficient.
September 21, 2021