public void imprimeArbol(Nodo E){
		if(E==null) return;
		ArrayDeque<Nodo> currentlevel,nextlevel;
		currentlevel=new ArrayDeque<Nodo>();
		nextlevel=new ArrayDeque<Nodo>();
		currentlevel.add(E);
		while(!currentlevel.isEmpty()){
			Nodo currNode=currentlevel.poll();
			
				if(currNode!=null){
					for(int i=0;i<currNode.tamSangria;i++) System.out.print("	");
					currNode.muestra();
					if(currNode.izq!=null){
						currNode.izq.tamSangria=currNode.tamSangria+1;
						nextlevel.add(currNode.izq);
					}
					if(currNode.der!=null){
						currNode.der.tamSangria=currNode.tamSangria+1;
						nextlevel.add(currNode.der);
					}
					if(currNode.sig!=null){
						currNode.sig.tamSangria=currNode.tamSangria+1;
						nextlevel.add(currNode.sig);
					}
				}
			if(currentlevel.isEmpty()){
				System.out.println();
				ArrayDeque<Nodo> c;
				c=currentlevel;
				currentlevel=nextlevel;
				nextlevel=c;
			}
		}
	}