there is a given binary tree(adsbygoogle = window.adsbygoogle || []).push({});

each of member are of a Node type

in the info part of each node we have a number.Code (Text):

class Node {

int info;

Node left;

Node right;

}

in each one of his leaves we have some number

and in each one of its roots (crossroads) we have zeros.

my gole is to build a method which calculates the difference between the

sums of the leaves in the right subtree of T

and the sum of the leaves in the left subtree of T

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# A binary tree question(java)

Loading...

Similar Threads - binary tree question | Date |
---|---|

Different Node Deletion/Insertion in a Binary Search Tree | Oct 23, 2016 |

Binary tree | Nov 21, 2010 |

Binary Tree java help! please, with getRight and getLeft subtree. | Dec 2, 2008 |

A question about binary tree(java) | Mar 18, 2008 |

**Physics Forums - The Fusion of Science and Community**