We can sort a given set of n numbers by first building a binary search tree containing these numbers (using Tree-Insert repeatedly to insert the numbers one by one) and then printing the numbers by an inorder tree walk. What are the worst-case and best-case running times for this sorting algorithm?

Worst case for binary search tree -O(n)

Best case for binary search tree -O(1)

Explanation:

The Binary search tree is the special type of binary tree. There are two child node

Left child nodeRight child node  In that, the right child node has a value greater than it’s the parent node. The left child node has value less than it’s the parent node.In the below fig. for inserting element 0, it must be inserted as the left child of 1. Therefore, for sorting we have traveled in reverse order from (3,2,1) this is the worst-case complexity O(n).

Through the process of sedimentation,sediment is turned back to rock to form sedimentation.the process of sedimentation is: > deposition-where fragments were deposited into the river or sea under gravity or travelling agent such as wind or water. > sedimentation-the fragments deposited in the river sedimented and accumulate> compaction-the layers of fragments deposited undergoes compaction due to the weight if the upper layers> cementation-chemical substance of the fragments such as cement dissolved into the water and cement the other fragments together to form sedimentary rock.thus,cementation and compaction are the process.on the other hand, transformation only occur when a rock under goes metamorphism(compaction or extreme heat).while recrystillization occurs when a rock is melted and cooled down,which also requires metamorphism to take place.hope it !