Problem
1. Define postorder traversal of a B-tree recursively to mean first traversing all the subtrees of the root, from left to right, in postorder, then visiting all the entries in the root. Write a method that will traverse a B-tree in postorder.
2. Remove the tail recursion from the function recursive_search_tree and integrate it into a nonrecursive version of search_tree.