struct Tree < int>>; bool ValsLess(Tree * t, int val) // post: return true if and only if all values in t are less than val
Simply B, children is asked to write IsBST having fun with ValsLess and you may provided the same form ValsGreater is obtainable. The answer is revealed below:
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); >
Читать далее «This relationships is named a recurrence family members as means»