Answer:
negatives = []
zeros = []
positives = []
while True:
number = input("Enter a number: ")
if number == "":
break
else:
number = int(number)
if number < 0:
negatives.append(number)
elif number == 0:
zeros.append(number)
else:
positives.append(number)
for n in negatives:
print(n)
for z in zeros:
print(z)
for p in positives:
print(p)
Explanation:
Initialize three lists to hold the numbers
Create a while loop that iterates until the user enters a blank line
Inside the loop:
If the number is smaller than 0, put it in the negatives list
If the number is 0, put it in the zeros list
Otherwise, put the number in the negatives list
When the while loop is done, create three for loops to print the numbers inside the lists
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 
.
