node * doo(node *root, int x){ if(root==0 || root->data==x) return root; if(root->data right,x); else return doo(root->left,x);) what is this code do? O a. search about a leaf item in the binary tree O b. Search about an item in the binary tree O c. search about an item in the doubly linked list O d. search about the item that is minimum and maximum in the same time in the binary tree