How do I recursively determine the maximum number of children that any vertex in a tree has?

Asked Oct 15 '14 at 07:35

Active Oct 15 '14 at 07:43

Viewed 75 times

function countChildren(node)  
    i=0
    m=0
    node = LMCHILD(node)
    while (w is not nil)  
        m = max{countChildren(node), m};
        w = RMSIB(w);
        i++;

    return max{i,m}

I have this so far, but I am tracing it and it doesnt work and I dont understand why. How can I make this recursive if i and m both get reset to 0 every time a recursive call is made

edited Oct 15 '14 at 07:43

Barmar

741,623
53
500
612

asked Oct 15 '14 at 07:35

canada89

Should that be `w = LMCHILD(node)`? – Barmar Oct 15 '14 at 07:47
Resetting `m` to `0` shouldn't be a problem, because the loop updates it. – Barmar Oct 15 '14 at 07:48

How do I recursively determine the maximum number of children that any vertex in a tree has?

0 Answers0