Boundary Traversal Of TREE

Boundary Traversal Of TREE

  October 04, 2017    

---

Idea is to break problem into 3 parts

1: all left nodes
2: leaf nodes
3: all right nodes

Note: Nodes who are leaf if contained in 1st or 3rd part won't be printed that's why check for is there in 1,3rd step.

Code:

/* A Binary Tree node
class Node
{
    int data;
    Node left, right;
    Node(int item)
    {
        data = item;
        left = right = null;
    }
}*/
class hackerranksolutionc
{
    void left(Node root)
    {
        if(root==null)
        return;
        if(root.left!=null)
        {
            System.out.print(root.data+" ");
            left(root.left);
        }
        else if(root.right!=null)
        {
            System.out.print(root.data+" ");
            left(root.right);
        }
    }
    void right(Node root)
    {
        if(root==null)
        return;
        if(root.right!=null)
        {
            right(root.right);
            System.out.print(root.data+" ");
        }
        else if(root.left!=null)
        {
            right(root.left);
            System.out.print(root.data+" ");
        }
    }
    void printleaf(Node node)
    {
        if(node==null)
        return;
        if(node.left!=null)
         printleaf(node.left);
        if(node.left==null && node.right==null)
         System.out.print(node.data+" ");
         
         else if(node.right!=null)
         printleaf(node.right);
    }
void printBoundary(Node node)
{ System.out.print(node.data+" ");
left(node.left);
printleaf(node);
right(node.right);
}
}