what is the worst case possible height of red-black tree? assume base of log as 2 in all options
Answer: The worst-case height of a red-black tree is 2log2(n + 1), where n is the number of nodes in the tree. This means that in the worst case, the height of a red-black tree with n nodes can be up to O(log n).