Question

Show the effect of making the following insertions into an initially empty red-black tree:
50,30,40,60,10,80,90,5,100​

Answer 1

Answer:

Insertion sort is a simple sorting algorithm that builds the final sorted array one item at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort.

Explanation:

hope I held u

Answer 2

hile will be helps u

thnx 4 asking