Answer:
Option (A)
Explanation:
In the post order traversal, we always print left subtree, then right subtree and then the root of the tree. In preorder traversal, First the root is printed, then, left subtree and at last, right subtree, so, the first element in preorder is the root of the tree and we can find elements of left sub tree from in order as all the elements written left to the root will of left subtree and similarly the right one. This is how repeating it will give the post order traversal.
Answer:
the answer is d use the forever block
Explanation:
I took the test and I got it right but sometimes it is different for others
Answer: A) Treats array entries as if they were strings that have same length.
Explanation:
Radix sort are used as sorting algorithm for integers. This algorithm used as general purpose for sorting the integer data. Basically, it is non comparative sorting integer that sort the given data by making the individual group.
It treats input value as strings of the digit, that is why it is defined as string sorting algorithm.
Therefore, Option (A) is correct.