Red Black Tree

Question

What is the largest possible number of internal nodes in a red-black tree with black height $4?$

Comments

I thought Red-Black tree is not in the syllabus, can anyone explain more about Red_Black Tree?

---

Yes, It is not in syllabus. Which Test Series?

---

Testbook

---

Not in the syllabus

---

Ok Thanks:)

Answer 1

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

=2log5=1.397