thmain

import java.util.LinkedList;
import java.util.Queue;

public class LevelOrderTraversal {
	
	public void levelOrderNaiveApproach(Node root){
		int h = height(root);
		for(int i=1;i<=h;i++){
 			printLevels(root,i);
 			System.out.println("");