Lecture Algorithms and data structures: Chapter 22 - Pointers
Lecture Algorithms and data structures: Chapter 22 - Pointers
In computer science, a balanced trees is a self-balancing tree data structure that keeps data sorted and allows searches, sequential access, insertions, and deletions in logarithmic time. In this topic, we will: Introduce the idea of balance and a few examples.