【LeetCode】Binary Tree Level Order Traversal(层序遍历)
QuestionGiven 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,9,20,#,#,15,7}, 3
/ \
9 20
/
原创
2015-06-24 15:26:08 ·
698 阅读 ·
0 评论