ujusdied2907 ujusdied2907 19-12-2022 Physics contestada the worst-case complexity of search, insert and remove is always the height of the tree, regardless of whether it is balanced