DSA

2-3-4 Trees – Properties, Insertion, Deletion, Time Complexity & Applications

In this article, we will learn about 2-3-4 Trees. We will look at the creation of 2-3-4 trees and look at the operations performed on this trees with examples. We will also look at the time for each operation and its applications. 2-3-4 Tree is a Self-balancing, Multiway Search Tree. It is always perfectly balanced. …

2-3-4 Trees – Properties, Insertion, Deletion, Time Complexity & Applications Read More »

Balanced Binary Tree – Definition, How to Check, Time & Space Complexity

In this article, we take a look into an important type of Binary Tree based Data Structure – Balanced Binary Tree. We will discuss the description of balanced binary trees with examples. Along with this, we will also look at an interesting problem related to it. Definition A Balanced Binary Tree commonly referred to as …

Balanced Binary Tree – Definition, How to Check, Time & Space Complexity Read More »