data structures mini search engine binary trees
approach O(n). To mitigate this, self-balancing binary trees are employed: AVL Trees: Maintain a balance factor at each node, ensuring height differences are minimal. Red-Black Trees: Use coloring rules to maintain approximately balance