Question

Write a function that takes three Trees, sort the trees in ascending order and merge the trees
into one tree which should be sorted in descending order and return it.​

Answer 1

Answer:

An in-order traversal of a binary search tree will always result in a sorted list of node items (numbers, strings or other comparable items). ... Traversal requires O(n) time, since it must visit every node. This algorithm is also O(n), so it is asymptotically optimal.