>>112
上から
p = tree_search(root, data);
if( data == p->data ) break;
if( data < p->data ) p = p->left;
else p = p->right;
return p;