+ while((c = tree->compare(data, root->data))) {
+ if(c < 0 && (child = root->left)) {
+ c = tree->compare(data, child->data);
+
+ if(c < 0 && (grandchild = child->left)) {
+ rightbottom->left = child;
+ child->parent = rightbottom;
+ rightbottom = child;
+
+ if((root->left = child->right))
+ child->right->parent = root;