Topic: Algorithms and Data Structures II

1. Given : L = {23, 17, 14, 6, 13, 10, 1, 5, 7, 12} ... do the following

a. Create a treesort. and explain what it does.

b. Do inorder traversal in STEPS.

c. Define what inorder traversal is and how it works in simple words.

d. Write the Pseudo Code of the treesort.

--

Please make this simple to understand. Write it out clear.