Tag archive

#self-balancing

Topic-specific entry points for internal linking, discovery, and deeper subject exploration.

2 articles

AVL Trees: Self-Balancing Binary Search Trees

AVL Trees (Self-Balancing BST) An AVL Tree is a self-balancing Binary Search Tree (BST) where the difference between heights of left and right subtrees cannot be more than one for all nodes. This ensures that the tree re…

Apr 20, 20262 min read

Deep Dive

#dsa#java#avl-trees

DSAIntermediate

Red-Black Trees in Java: The Engine Behind TreeMap and HashMap

If you've ever used java.util.TreeMap or java.util.TreeSet, you've already used a Red-Black Tree. It is the most popular self-balancing binary search tree in modern software libraries because it offers a perfect balance…

Apr 20, 20263 min read

Deep Dive

#dsa#java#binary search tree