Answer:
A Red Black Tree is a type of self-balancing(BST) in this tree ,each node is red or black colored. The red black tree meets all the properties of the binary search tree, but some additional properties have been added to a Red Black Tree.
A Red-Black tree's height is O(Logn) where (n is the tree's amount of nodes).
In a red-black tree with black height k
The maximum number of internal nodes is [tex]2^{2k}[/tex] [tex]-1[/tex].
The smallest possible number is [tex]2^{k}[/tex] [tex]-1[/tex].
