This relationships is called a recurrence relatives as function
struct Tree < int>>; bool ValsLess(Tree * t, int val) // post: return true if and only if all values in t are less than val
Partly B, people was questioned to type IsBST playing with ValsLess and you can if an identical setting ValsGreater is obtainable. The clear answer are revealed lower than:
bool IsBST(Tree * t) // postcondition: returns true if t represents a binary search // tree containing no duplicate values; // otherwise, returns false. < if>left,t->info) && ValsGreater(t->right,t->info) && IsBST(t->left) && IsBST(t->right); >
Before continuous try to dictate/guess/need on what the newest difficulty regarding IsBST is for a keen n-node tree. Assume that ValsLess and you can ValsGreater both run-in O(n) going back to a keen n-node tree.
A work with the exact same features
What is the asymptotic complexity of the function DoStuff shown below. Why? Assume that the function Combine runs in O(n) time when |left-right| = letter, i.e., when Combine is used to combine n elements in the vector a.
You could accept so it become an utilization of Mergesort. You can also understand that the fresh difficulty from Mergesort is O(n record letter) fo a keen n-ability range/vector. Why does that it relate to the function IsBST?
The Reoccurrence Loved ones
T(..) occurs on both sides of the = sign. (more…)
