In lecture 10, we saw how to create a BinaryTreeDepthFirstCrawlerCallback function for aBinaryTreeDepthFirstCrawler to build a string for an expression tree in fully-parenthesized infix order. This assignment is to create a callback function toPrefix() that builds a string for an expression tree in fully-parenthesized prefix order, and a callback function toPostfix() that builds a string for an expression tree in unparenthesized postfix (RPN) order.
Make a local copy of the lecture-10 GitHub repository, and add these function to “binary_tree_depth_first_crawler_main.c”. Also add calls to test these functions in testCrawlerRecursive() in this file. You may also add similar tests to testCrawlerIterative(). These functions currently contain tests for toInfix()and your tests should do something similar.
Check in all the files from lecture 10 including your modified “binary_tree_depth_first_crawler_main.c” ro your assignment-5-ccisid GitHub repository so that the graders can run your code and see the results.