in DS
1,580 views
0 votes
0 votes
What is the largest possible number of internal nodes in a red-black tree with black height $4?$
in DS
1.6k views

4 Comments

Testbook
0
0
Not in the syllabus
0
0
Ok Thanks:)
0
0

1 Answer

0 votes
0 votes
The largest no of possible  node is 2(log(4+1))

=2log5=1.397