Question discussion

What is the at most height of red-black tree with n internal node?

359871Medium DSSSB TGT Computer Science 0 replies 0 views
0

What is the at most height of red-black tree with n internal node?

  • A2log2(n + 1)
  • Blog2(2n + 1)
  • Clog2n
  • Dn
Correct answer: A

Explanation

A red-black tree with n internal nodes has height at most 2·log₂(n + 1).

Discussion 0

Nobody has replied yet. Start the discussion!