This is a question from the book Algorithms by Robert Sedgewick and Kevin Wayne.Find a sequence of keys to insert into a BST and into a red-black BST such that the height of the BST is less than the height of the red-black BST, or prove that no such sequence is possible.I think that in most cases, if not all, the height of a RBT is less than the height of a BST because the RBT ensures balance. However, is it possible for the height of a BST to be less than the height of a RBT? If so, how? Else, how to prove it?
Can the height of a binary search tree be less than that of a red-black tree?
binary trees