给出过程TREE-INSERT的一个递归版本。

//递归插入void Tree_Indert_Ite(TreeNode *root,TreeNode *node){	if (node->data<=root->data){		if (!root->left){			root->left=node;			node->parent=root;		}else{			Tree_Indert_Ite(root->left,node);		}	}else{		if (!root->right){			root->right=node;			node->parent=root;		}else{			Tree_Indert_Ite(root->right,node);		}	}}