the worst-case complexity of search, insert and remove is always the height of the tree, regardless of whether it is balanced