Last active
May 26, 2018 23:46
-
-
Save thmain/f7c3a9583e6dbcbe3fdc to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
public class LeftLeavesSum { | |
// Do the inorder traversal | |
// check if node if the left child and leaf node | |
// if yes then add it to the sum | |
public static int leftLeavesSum = 0; | |
public static void leftSum(Node root, Node parent) { | |
if (root != null) { | |
leftSum(root.left, root); | |
if (root.left == null && root.right == null && parent.left == root) { | |
leftLeavesSum += root.data; | |
} | |
leftSum(root.right, root); | |
} | |
} | |
public static void main(String args[]) { | |
Node root = new Node(10); | |
root.left = new Node(5); | |
root.right = new Node(15); | |
root.left.left = new Node(10); | |
root.left.right = new Node(12); | |
root.left.right.left = new Node(6); | |
root.right.right = new Node(8); | |
root.right.right.left = new Node(5); | |
leftSum(root, root); | |
System.out.println("Sum of left leaves: " + leftLeavesSum); | |
} | |
} | |
class Node { | |
int data; | |
Node left; | |
Node right; | |
public Node(int data) { | |
this.data = data; | |
this.left = null; | |
this.right = null; | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment