Created
February 25, 2016 02:38
-
-
Save thmain/0e264ea7145ce6b57cb1 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 DeepestNode { | |
int deepestlevel; | |
int value; | |
public int Deep(Node root) { | |
find(root, 0); | |
return value; | |
} | |
public void find(Node root, int level) { | |
if (root != null) { | |
find(root.left, ++level); | |
if (level > deepestlevel) { | |
value = root.data; | |
deepestlevel = level; | |
} | |
find(root.right, level); | |
} | |
} | |
public static void main(String args[]) { | |
Node root = new Node(1); | |
root.left = new Node(2); | |
root.right = new Node(3); | |
root.left.left = new Node(4); | |
root.left.right = new Node(5); | |
root.right.left = new Node(6); | |
root.right.right = new Node(7); | |
root.right.right.right = new Node(8); | |
DeepestNode dp = new DeepestNode(); | |
System.out.println("Deepest child is: " + dp.Deep(root)); | |
} | |
} | |
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