find tre path

public void findAllPath( Node root, int sum, LinkedList<int> link )
{
    LinkedList<int> linkTemp = new LinkedList<int>();
    copyLink( linkTemp, link );

    if( root == NULL )
    {
        return ;
    }
    if( sum < root.data )
    {
        return ;
    }
    link.add( root.data );
    if( root.lChild )
    {
        findAllPath( root.lChild, sum - root.data, linkTemp );
    }
    if( root.rChild )
    {
        findAllPath( root.rChild, sum - root.data, linkTemp );
    }
    if( !root.lChild && ! root.rChild )
    {
        if( sum == 0 )
        {
            for( int s : link )
            {
                printf( s );
            }
        }
    }

}

Advertisements
This entry was posted in Uncategorized. Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s