Modify the utility functions, by adding the predefine macros. In this way, we could circulate include certain files.
Required Single linked list to implement this algorithm
Q02_03
Q02_04
Q02_06
Q02_07
Another simple version of Q04_03.cpp there is another version: Q04_03_cool.cpp, which is better than this one.
The original TreeNode script in Utility folder. This one is definitely cool version of the TreeNode implementation including DFS and BFS traverse.
expend DFS traverse for preorder, in order and postorder traverse as well by using recursion.
merge TreeNode.cpp with Q04_03_cool.cpp
Also finish Q04_04.cpp
adding merge sort based on only one input array and dynamic allocated helper array.
Q10_02 by using boost::unorder_map and lambda for hashing and comparison function respectively.
Q10_07 this is a good question with some very good practice, such as lambda and overload < operator