Question

a red black tree with n internal nodes has maximum height of what​

Answer 1

Answer:batao re jisko parts hai vo comments kare

Answer 2

Answer:

We also told that basic operation of a binary search tree can be done in O(lgn) ⁡ worst-case time on a red-black tree. To prove this, we will first prove that a binary search tree following the above properties (thus, a red-black tree) with n internal nodes can have a maximum height of 2lg(n+1) ⁡ .