Yahoo

  www.yahoo.com
  www.yahoo.com

Interview Question

Intern Interview

What is the largest possible number of internal nodes in a

  red-black tree with black-height k? What is the smallest possible number?
Answer

Interview Answer

1 Answer

0

k+1

harish kumar on Jun 28, 2012

Add Answers or Comments

To comment on this, Sign In or Sign Up.