TreeNode* search(TreeNode* root, int target) {
  if (root == NULL || root->val == target) {
    return root;
  }
  if (_______________) {
    return search(root->left, target);
  } else {
    return search(root->right, target);
  }
}