Tree Right View Java

justformyntra8 · June 1, 2019, 5:42pm

I am getting the wrong answer for a particular test case.
Kindly let me know where is it failing:

bhardwaj-aman/java-data-structures-practice-questions/blob/master/(*)Right view of binary tree

package treepractice;
import java.util.*;
public class Main {
    public static void main(String args[]) {
        Scanner s = new Scanner(System.in);
        String str = s.nextLine();
		if(str==""){
			System.out.println("-1");
		}
		else{
        String[] a = str.split(" ");
        int i=1;
        while((int)(Math.pow((double)2,(double)i))-2<a.length){
          //  System.out.println("2^i is: "+(int)(Math.pow((double)2,(double)i)-1));
            int x=(int)(Math.pow((double)2,(double)i))-2;
            int y=x-(int)(Math.pow((double)2,(double)(i-1)));
            if((a[x].equals("-1"))==false){
                System.out.print(a[x]+" ");
            }else {
                for(int j=x;j>=y;j--){

This file has been truncated. show original