删除功能更加完备的红黑树(三)

2014-11-24 00:04:17 · 作者: · 浏览: 98
ode ,i);

printf("%d \n",depth (node->root));

mid_print (node->root,0);

printf("\n");

}

printf("into insert mode\n");

while( scanf("%d",&i) && i)

{

insert (node ,i);

printf("%d \n",depth (node->root));

mid_print (node->root,0);

printf("\n");

}

}

/*

left_print (node->root);

printf("\n");

right_print (node->root);

printf("\n");

*/

return 0;

}

摘自chenbingchenbing的专栏