You are not logged in. Please login at www.codechef.com to post your questions!

×

red black tree clrs

What is the largest possible number of internal nodes in a red-black tree with black-height k? What is the smallest possible number?please explain...............

asked 14 Jul '13, 10:01

whiteknight321's gravatar image

0★whiteknight321
26689
accept rate: 0%

toggle preview
Preview

Follow this question

By Email:

Once you sign in you will be able to subscribe for any updates here

By RSS:

Answers

Answers and Comments

Markdown Basics

  • *italic* or _italic_
  • **bold** or __bold__
  • link:[text](http://url.com/ "title")
  • image?![alt text](/path/img.jpg "title")
  • numbered list: 1. Foo 2. Bar
  • to add a line break simply add two spaces to where you would like the new line to be.
  • basic HTML tags are also supported
  • mathemetical formulas in Latex between $ symbol

Question tags:

×15,026
×1,819
×1,620
×242
×162

question asked: 14 Jul '13, 10:01

question was seen: 1,310 times

last updated: 14 Jul '13, 10:01