Exercise 4 relates to data structure. The three data orders are created using the analogy of tree structure. It consists a root and two nodes and the two nodes extends further with the same structure. Again this is heavily related to recursion. Seems like recursion is the natural way to do a lot things.
So far I cannot tell how this tree data structure is more efficient than others. Hope I can find the answer next week.
No comments:
Post a Comment