Only one test case is passing plz tell me what is wrong in my code

#1

import java.util.*;
public class Main {

static Scanner scn = new Scanner(System.in);

public static void main(String[] args) {
	Main m = new Main();
	BinaryTree bt = m.new BinaryTree();
	bt.topView();
}

private class BinaryTree {
	private class Node {
		int data;
		Node left;
		Node right;
	}

	private Node root;
	private int size;

	public BinaryTree() {
		this.takeInput();
	}

	public void takeInput() {
        LinkedList<Node> queue = new LinkedList<>();
        root = new Node();
        root.data = scn.nextInt();
        queue.addLast(root);

        while(!queue.isEmpty()){
            Node node = queue.removeFirst();

            if(node.data == -1){
                continue;
            }

            node.left = new Node();
            node.right = new Node();
            node.left.data = scn.nextInt();
            node.right.data = scn.nextInt();
            
            queue.addLast(node.left);
            queue.addLast(node.right);
        }   
		
	}

    public void topView(){
       
        topView(this.root,false);
        
    }

    private void topView(Node node,boolean ilc){

        if(node.data == -1){
            return;
        }
        
        if (node==this.root) {

            topView(node.left,true);
            System.out.print(node.data+" ");
            topView(node.right,false);
            return;
        }
        else {
        	if (ilc==true) {
        		topView(node.left,true);
        	}
        	else {
        		topView(node.right,false);
        	}
        }
        System.out.print(node.data+" ");

        
    }
}

}

#2

your tree top view function is not correct.refer to this corrected code here

#3

this is the code that i submitted last

#4

this will only pass the test cases but it is not appropriate for complex unbalanced binary tree

#5

refer to this code here