树---多叉树的遍历

package com.Tree;

import java.util.LinkedList;
import java.util.Queue;
import java.util.Stack;
//多个孩子进行层次遍历
public class manyTrees {

	public static void main(String[] args) {
		sk_node b = new sk_node();
		//建立二叉树
		sk_node root = b.CreatBTree();
		
		Queue<sk_node> queue = new LinkedList<sk_node>();
		
		while(root.childs!=null){
			System.out.println(root.data);
			
			for(int i=0;i<root.childs.length;++i){
				queue.offer(root.childs[i]);
			}
			 root = queue.poll();
		}
		
	}

}