Return to Question

public class TreeNode {

     int data;
    private TreeNode left;
    private TreeNode right;
    public TreeNode getLeft() {
        return left;
    }
    public void setLeft(TreeNode left) {
        this.left = left;
    }
    public TreeNode getRight() {
        return right;
    }
    public void setRight(TreeNode right) {
        this.right = right;
    }
     
    
    public TreeNode(int data)
    {
        this.data=data;
        this.setLeft(null);
        this.setRight(null);
    }
    
}

public class TreeNode {

     int data;
    private TreeNode left;
    private TreeNode right;
    public TreeNode getLeft() {
        return left;
    }
    public void setLeft(TreeNode left) {
        this.left = left;
    }
    public TreeNode getRight() {
        return right;
    }
    public void setRight(TreeNode right) {
        this.right = right;
    }
     
    
    public TreeNode(int data)
    {
        this.data=data;
    }
    
}

Call to the method

 Map<Integer,Set<Integer>> verticalStrips = new HashMap<Integer,Set<Integer>>(); 
verticalStrips =printStripsVertically(root,verticalStrips,0);//where root is the root of the tree.

I've dry-tested the algorithm to work, but I'm not quite convinced that iterating over the leftMap and rightMap is the cleanest way to go about this, so I'm looking for any suggestions towards that in particular or the code in general.

Edit : TreeNode.java

public class TreeNode {

     int data;
    private TreeNode left;
    private TreeNode right;
    public TreeNode getLeft() {
        return left;
    }
    public void setLeft(TreeNode left) {
        this.left = left;
    }
    public TreeNode getRight() {
        return right;
    }
    public void setRight(TreeNode right) {
        this.right = right;
    }
     
    
    public TreeNode(int data)
    {
        this.data=data;
        this.setLeft(null);
        this.setRight(null);
    }
    
}

I've dry-tested the algorithm to work, but I'm not quite convinced that iterating over the leftMap and rightMap is the cleanest way to go about this, so I'm looking for any suggestions towards that in particular or the code in general.

I'm trying to print a binary tree in vertical strips

For instance a tree like this  :

       8
     /   \
    6     10
   / \   /  \
  4   7 9    12
 / \
3   5

3
4
6 5
8 7 9
10
12

Here's how I'm doing it .

I've dry-tested the algorithm to work.

But I'm not quite convinced that iterating over the leftMap and rightMap is the cleanest way to go about this, so I'm looking for any suggestions towards that in particular or the code in general.

I'm trying to print a binary tree in vertical strips.

For instance, a tree like this:

       8
     /   \
    6     10
   / \   /  \
  4   7 9    12
 / \
3   5

3
4
6 5
8 7 9
10
12

Here's how I'm doing it:

I've dry-tested the algorithm to work, but I'm not quite convinced that iterating over the leftMap and rightMap is the cleanest way to go about this, so I'm looking for any suggestions towards that in particular or the code in general.