kaveh
• Only basic functional facilities of selected environments are allowed to be used. All needed functions and data structures should be implemented.
• Document on design and working state of delivered programs should be attached.
• Consider all possible situations and discuss them even if not considered in implementation. For example all possible cases for input parameters such as NULL should be taking into account.
3. Tree search.
Implement a function which searches a Tree in order to find a node which satisfies a certain property. We shall not concern ourselves with the very important concepts of organizing or optimizing the search; rather we shall simply be concerned with the way in which basic kinds of search (BFS, DFS …) can be programmed.
• Document on design and working state of delivered programs should be attached.
• Consider all possible situations and discuss them even if not considered in implementation. For example all possible cases for input parameters such as NULL should be taking into account.
3. Tree search.
Implement a function which searches a Tree in order to find a node which satisfies a certain property. We shall not concern ourselves with the very important concepts of organizing or optimizing the search; rather we shall simply be concerned with the way in which basic kinds of search (BFS, DFS …) can be programmed.