FInding Finding the maximum value in a binary tree

deleted 2 characters in body; edited title

Source Link

edited Sep 5, 2015 at 16:08

Jamal

35.2k
13
134
238

Better way to find FInding the maximum value in a Binary Treebinary tree

I have to find the maximum value in a binary tree. This is how I did it iteratively:

int maxValue(Node* node)
{
    if (node == nullptr)
        throw "BT is empty";

    int max = node->data;
    for (Node* left = node; left != nullptr; left = left->left)
    {
        if (left->data > max)
            max = left->data;
    }
    
    for (Node* right = node; right != nullptr; right = right->right)
    {
        if (right->data > max)
            max = right->data;
    }
    
    return max;
}

I don't know if this is the best way to do it. How can this be improved? Is there a recursive solution?

Better way to find the maximum value in a Binary Tree

I have to find the maximum value in a binary tree. This is how I did it iteratively:

int maxValue(Node* node)
{
    if (node == nullptr)
        throw "BT is empty";

    int max = node->data;
    for (Node* left = node; left != nullptr; left = left->left)
    {
        if (left->data > max)
            max = left->data;
    }
    
    for (Node* right = node; right != nullptr; right = right->right)
    {
        if (right->data > max)
            max = right->data;
    }
    
    return max;
}

I don't know if this is the best way to do it. How can this be improved? Is there a recursive solution?

FInding the maximum value in a binary tree

I have to find the maximum value in a binary tree. This is how I did it iteratively:

int maxValue(Node* node)
{
    if (node == nullptr)
        throw "BT is empty";

    int max = node->data;
    for (Node* left = node; left != nullptr; left = left->left)
    {
        if (left->data > max)
            max = left->data;
    }
    
    for (Node* right = node; right != nullptr; right = right->right)
    {
        if (right->data > max)
            max = right->data;
    }
    
    return max;
}

I don't know if this is the best way to do it. How can this be improved? Is there a recursive solution?