3) Design a recursive algorithm to verify that every node in a binary search tree maintains the searchability condition (left child smaller, right child greater) for all nodes. 4) Two trees, T1 and T2, are isomorphic if T1 can be transformed into T2 by swapping left and right children of (some of the) nodes in T1. For instance, the two trees below are isomorphic because they are the same if the children of A, B, and G, but not the other nodes, are swapped. Create a polynomial time algorithm to check if two trees passed as input are isomorphic. What is the overall run time of your algorithm? Solution Answer 3: int validBST(struct node* node, int minimum, int maximum) { // BST is empty if (node==NULL) return 1; //as this node voilates the maximum and minimum exit the function with zero if (node->data < minimum || node->data > maximum) return 0; checking the subtree of the parent node ...
Purchase document to see full attachment