[LeetCode] 102. Binary Tree Level Order Traversal 二叉树层序遍历

Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example:Given binary tree {3
posted @ 2014-10-26 04:57  Grandyang  阅读(28560)  评论(11)  编辑  收藏  举报
Fork me on GitHub