Question 20 5 pi What does the following code do? Assume the root of the binary tree is passed into the function, and assume the following struct is defined, also assume that root->item is initally passed into x when the function is first called struct bin TreeNode { int item; binTreeNode * left, * right; }; int foo (binTreeNode *r, int x) { if (r == NULL) return x; int z; if (r->item > X) z=r->item; else Z = x; int a = foo(r->left, z); int b = foo(r->right, z); if (a > b) return a; else return bi } Edit View Insert Format Tools Table 12pt B I U Paragraph T2 o