Question: Suppose we have the subsequent set of numbers{10,11,15,19,23,78,42,56,18,13,12,38,47}.
Part 1: Determine the order of insertions with this set of numbers that will result in a perfectly balanced BST(Binary Search Tree).
Part 2: Show the result of a preorder traversal of this tree.
Part 3: Delete the root, make a diagram of the resulting tree.
You need to find the order of insertions and show the preorder traversal.