2013年5月25日
Binary Tree Level Order Traversal
摘要： //Given a binary tree, return thelevel ordertraversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree{3,9,20,#,#,15,7}, 3 / \ 9 20 / \ 15 7return its level order traversal as:[ [3], [9,20], [15,7]]struct QueueNode { TreeNode *pTr; ... 阅读全文
posted @ 2013-05-25 21:17 summer_zhou 阅读(113) 评论(0) 推荐(0)