Trees as Data Structures

Linear structures like arrays or (linked) lists present the inconvenience that at least one of the function to access (search), insert or remove an element have complexity \(\varTheta (n)\) in the worst case. Non-linear structure like treesTree allow to perform this operations in logarithmic time.