Skip to content

Instantly share code, notes, and snippets.

@thmain
Created February 23, 2016 03:37
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save thmain/403da2f740b0e95ae3ea to your computer and use it in GitHub Desktop.
Save thmain/403da2f740b0e95ae3ea to your computer and use it in GitHub Desktop.
public class PrintNoSiblingsNodes {
public void printOnlyLeaves(Node root){
if(root!=null){
printOnlyLeaves(root.left);
if((root.left==null) && (root.right!=null)){
System.out.print("" + root.right.data);
}
if((root.left!=null) && (root.right==null)){
System.out.print("" + root.left.data);
}
printOnlyLeaves(root.right);
}
}
public static void main (String[] args) throws java.lang.Exception
{
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.left.right.left = new Node(7);
root.left.left.left = new Node(6);
root.right.right = new Node(8);
root.right.right.left = new Node(9);
PrintNoSiblingsNodes i = new PrintNoSiblingsNodes();
System.out.print("Nodes with No Siblings: ");
i.printOnlyLeaves(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