PPT Slide

/* insert x into t and return the resulting tree */

NODE_PTR insert(NODE_PTR t, int x){

if (t==NULL) return makeNode(x);

if (x <= t->info)

t->left = insert(t->left,x);

else

t->right = insert(t->right,x);

}