AVL树C语言完整实现(4)

root = deleteNode(2, root);
 printf("\n++++++++delete 2++++++++++\n");
 InOrderTraverse(root);
 printf("\n");
 PreOrderTraverse(root);
 printf("\n");

destroyAVL(root);
}

内容版权声明:除非注明,否则皆为本站原创文章。

转载注明出处:http://www.heiqu.com/ab482f4d8c8dc0606f230860a7b9a1f4.html