二叉树的层序遍历

Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).java For example: Given binary tree{3,9,20,#,#,15,7},node 3 / \ 9 20

>>阅读原文<<