Question: Advanced Algorithm : Abstract Data Types 1 Abstract Data Types (approx. 8 pts) Define an extension to the general Tree ADT with operation contains, a

Advanced Algorithm : Abstract Data Types
1 Abstract Data Types (approx. 8 pts) Define an extension to the general Tree ADT with operation contains, a predicate that tests wether a given tree contains a given element. Hint: you will probably have to create an fContains companion predicate, that tests wether a given forest contains a given element
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
