package binarytree;
class Node {
Node left;
Node right;
int data;
}
class BinaryTree {
int maxSum;
public void maxSumFromRootToLeaf(Node node, int sum) {
if (node == null) {
return;
}
if (node.left == null && node.right == null && sum + node.data > maxSum) {
maxSum = sum + node.data;
return;
}
maxSumFromRootToLeaf(node.left, sum + node.data);
maxSumFromRootToLeaf(node.right, sum + node.data);
}
public Node createNewNode(int val) {
Node newNode = new Node();
newNode.data = val;
newNode.left = null;
newNode.right = null;
return newNode;
}
}
public class BinaryTreeApp {
public static void main(String[] args) {
BinaryTree a = new BinaryTree();
Node root = a.createNewNode(2);
root.left = a.createNewNode(7);
root.right = a.createNewNode(5);
root.left.left = a.createNewNode(2);
root.left.right = a.createNewNode(6);
root.left.right.left = a.createNewNode(5);
root.left.right.right = a.createNewNode(11);
root.right.right = a.createNewNode(9);
root.right.right.left = a.createNewNode(4);
a.maxSumFromRootToLeaf(root, 0);
System.out.println(a.maxSum);
}
}
|