LeetCode之levelTraverse
2014-04-06 12:25
288 查看
int levelTraverse(TreeNode* tree) //按层遍历二叉树,队列实现
{
if(tree==NULL) {return 0;}
TreeNode* p;
p=tree;
queue<TreeNode*> q;
q.push(p);
//int level=maxDepth(tree);
while (!q.empty())
{
p=q.front();
cout<<p->val;
q.pop();
if (p->left!=NULL)
q.push(p->left);
if (p->right!=NULL)
q.push(p->right);
}
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode之levelTraverse
- leetcode之Binary Tree Level Order Traverse
- LeetCode – Refresh – Binary Tree Zigzag Level Order Traversal
- LeetCode 之 Binary Tree Level Order Traversal II
- LeetCode:Binary Tree Zigzag Level Order Traversal
- 【Leetcode】Binary Tree Zigzag Level Order Traversal
- Leetcode60: Binary Tree Level Order Traversal II
- leetCode No.103 Binary Tree Zigzag Level Order Traversal
- leetcode：Binary Tree Level Order Traversal II 【Java】
- leetcode 102 —— Binary Tree Level Order Traversal
- 【leetcode 层序遍历】Binary Tree Zigzag Level Order Traversal
- LeetCode103 Binary Tree Zigzag Level Order Traversal
- [Leetcode]Binary Tree Zigzag Level Order Traversal
- LeetCode - Binary Tree Level Order Traversal II
- LeetCode103 BinaryTreeZigzagLevelOrderTraversal(二叉树Z形层次遍历) Java题解
- (leetcode)Binary Tree Level Order Traversal II
- [LeetCode] 013: Binary Tree Level Order Traversal II
- LeetCode 103 Binary Tree Zigzag Level Order Traversal
- LeetCode: 107_Binary Tree Level Order Traversal II | 二叉树自底向上的层次遍历 | Easy
- leetcode Binary Tree Level Order Traversal