public void printTries(){
		System.out.println("root");
		
		LinkedList<Node> queue = new LinkedList<Node>();
		queue.addLast(root);
		int size = 1, next_size = 0;
		while(!queue.isEmpty()){
			Node x = queue.getFirst();
			queue.removeFirst();
			System.out.print(Arrays.toString(x.childs));
			size--;
			for(Node t : x.childs){
				if(t != null){
					queue.addLast(t);
					next_size++;
				}
			}
			if(size == 0){
				System.out.println("\n");
				size = next_size;
				next_size = 0;
			}
		}
		
		
	}