void F(node&*root){if(root!=0){F(root->left); F(root->right); root->data=0; delete root;}root=0;} this code Select one: a. free the binary tree and returns it empty b. Set all data items in the binary...

void F(node&*root){if(root!=0){F(root->left); F(root->right); root->data=0; delete root;}root=0;} this code

Select one:

free the binary tree and returns it empty