red black tree clrs

algorithm
c-plus-plus
code
editorial
logic

#1

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…