Method leftBoundary

TreeBoundaryTraversalBinaryTree.java:13–23

(Node node, ArrayList<Integer> list)

	}
	
	void leftBoundary(Node node, ArrayList<Integer> list)
	{
	    node=node.left;
	    if(node==null) return;
	    while(node!=null)
	    {
	        if(node.left!=null || node.right!=null ) list.add(node.data);
	        if(node.left!=null) node=node.left;
	        else node=node.right;
	    }
	}
	
	void rightBoundary(Node node, ArrayList<Integer> list)
	{