what is the largest possible number of internal nodes in a redblack tree with black height k? what is the smallest possiblenumbe
1 answer:
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
.
The smallest possible number is
.
You might be interested in
Answer:
Following are the code to this question:
b= input()#defining b variable for input character value
h= input()#defining h variable for input character value
b_width=6#defining b_width variable that holds an integer value 6
r1 = ' ' * b_width+h#defining r1 variable that calculates hash lines
r2 = b*b_width+h*2#defining r3 variable that calculates 6 asterisk and 2 hash line
r3 = b*b_width+h*3#defining r3 variable that calculates 6 asterisk and 3 hash line
print(r1)#print r1 variable value
print(r2)#print r2 variable value
print(r3)#print r3 variable value
print(r2)#print r2 variable value
print(r1)#print r1 variable value
Output:
please find the attachment.
Explanation:
In the given python code, three variable "b,h, and b_width" is declared, in which "b_width" holds an integer variable "6" and variable "b and h" is used to an input character value. In the next line, "r1, r2, and r3" is declared, that holds arrowhead values which can be defined as follows:
- In the "r1" variable, it stores space with b_width variable and one h variable value.
- In the "r2" variable it stores b_width and 2*h variable value.
- In the "r3" variable it stores b_width and 3*h variable value.
At the last, it prints the "r1, r2, and r3" variable value and for arrowheads, it follows the above program code.
