一步一步写算法(之排序二叉树删除-1) (三)

2014-11-23 23:36:33 · 作者: · 浏览: 29

assert(TRUE == insert_node_into_tree(&pTreeNode, 20));

assert(TRUE == delete_node_from_tree(&pTreeNode, 10));

assert(15 == pTreeNode->data);

assert(NULL == pTreeNode->parent);

free(pTreeNode->right_child);

free(pTreeNode);

}

static void test5()

{

TREE_NODE* pTreeNode = NULL;

assert(TRUE == insert_node_into_tree(&pTreeNode, 10));

assert(TRUE == insert_node_into_tree(&pTreeNode, 15));

assert(TRUE == insert_node_into_tree(&pTreeNode, 20));

assert(TRUE == delete_node_from_tree(&pTreeNode, 10));

assert(15 == pTreeNode->data);

assert(NULL == pTreeNode->parent);

free(pTreeNode->right_child);

free(pTreeNode);

}

2.4删除数据的左右节点都存在