0What is the at most height of red-black tree with n internal node?A2log2(n + 1)Blog2(2n + 1)Clog2nDn Correct answer: A ExplanationA red-black tree with n internal nodes has height at most 2·log₂(n + 1). Join the discussion Report an error Share