leetcode 日经贴,Cpp code -Binary Tree Level Order Traversal
2015-04-28 15:47
302 查看
Binary Tree Level Order Traversal
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class Solution { public: vector<vector<int> > levelOrder(TreeNode *root) { vector<vector<int> > ans; queue<TreeNode *> q; vector<int> level; if (!root) { return ans; } q.push(root); q.push(NULL); while (!q.empty()) { TreeNode *r = q.front(); q.pop(); if (!r) { ans.push_back(level); level.clear(); if (!q.empty()) { q.push(NULL); } } else { level.push_back(r->val); if (r->left) { q.push(r->left); } if (r->right) { q.push(r->right); } } } return ans; } };
相关文章推荐
- leetcode 日经贴,Cpp code -Binary Tree Level Order Traversal II
- leetcode 日经贴,Cpp code -Binary Tree Zigzag Level Order Traversal
- leetcode 日经贴,Cpp code -Binary Tree Postorder Traversal
- leetcode 日经贴,Cpp code -Construct Binary Tree from Preorder and Inorder Traversal
- leetcode 日经贴,Cpp code -Construct Binary Tree from Inorder and Postorder Traversal
- leetcode 日经贴,Cpp code -Binary Tree Preorder Traversal
- leetcode 日经贴,Cpp code -Binary Tree Inorder Traversal
- [Leetcode] Binary Tree Level Order Traversal
- LeetCode 103: Binary Tree Zigzag Level Order Traversal
- Binary Tree Level Order Traversal -- LeetCode
- LeetCode107 Binary Tree Level Order Traversal II
- LeetCode-Binary Tree Level Order Traversal
- [leetcode]Binary Tree Zigzag Level Order Traversal
- leetCode(16):Binary Tree Level Order Traversal
- Leetcode-Binary Tree Level Order Traversal
- LeetCode 107 Binary Tree Level Order Traversal II(二叉树的层级顺序遍历2)(*)
- LeetCode Binary Tree Level Order Traversal II
- C++详解Leetcode:103. Binary Tree Zigzag Level Order Traversal
- 【LeetCode】Binary Tree Level Order Traversal
- LeetCode Binary Tree Level Order Traversal