Exemplos de bst_find_minimum em C++ (Cpp)

Exemplo n.º 1

Arquivo: bst.cpp Projeto: brycekelleher/algo

void bst_successor(node_t *n)
{
	if (n->children[1])
		return bst_find_minimum(n->children[1]);
	else
		return bst_find_minimum(n->parent->children[1]);
		// go up one level and run bst_find_minimum on that subtree
		// what if the parent doesn't have a right subtree?
}

Exemplo n.º 2

Arquivo: Solution06.cpp Projeto: yaobinwen/Dreaming_in_Code

TreeNode * bst_find_successor(TreeNode * node) {
    TreeNode * curr = node;

    if (curr->right != NULL) {
        return bst_find_minimum(curr->right);
    }

    TreeNode * parent = curr->parent;
    while (parent != NULL && parent->right == curr) {
        curr = parent;
        parent = parent->parent;
    }

    return parent;
}