{"id":2154,"date":"2016-08-30T21:44:39","date_gmt":"2016-08-30T13:44:39","guid":{"rendered":"http:\/\/boweihe.me\/?p=2154"},"modified":"2016-08-30T21:44:39","modified_gmt":"2016-08-30T13:44:39","slug":"leetcode-102-binary-tree-level-order-traversal","status":"publish","type":"post","link":"https:\/\/dayandcarrot.space\/?p=2154","title":{"rendered":"LeetCode 102. Binary Tree Level Order Traversal"},"content":{"rendered":"

\u7ec3\u624b\u6c34\u9898\uff0c\u76f4\u63a5\u8d34\u4ee3\u7801\u3002\u5feb\u8f6c\u6b63\u9762\u8bd5\u4e86\uff0c\u865a\u554a\uff0c\u9b3c\u6653\u5f97BOSS\u4f1a\u95ee\u70b9\u4ec0\u4e48\u3002<\/p>\n

\/**\n * Definition for a binary tree node.\n * struct TreeNode {\n *     int val;\n *     TreeNode *left;\n *     TreeNode *right;\n *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}\n * };\n *\/\nclass Solution {\npublic:\n    vector<vector<int>> levelOrder(TreeNode* root) {\n        vector<vector<int>> results;\n        if(root == NULL)\n            return results;\n        queue<TreeNode*>* currQueue = new queue<TreeNode*>();\n        queue<TreeNode*>* candidateQueue = new queue<TreeNode*>();\n        currQueue->push(root);\n        vector<int> levelResult;\n        while(!currQueue->empty()){\n            TreeNode* currNode = currQueue->front();\n            currQueue->pop();\n            levelResult.push_back(currNode->val);\n            if(currNode->left != NULL)\n                candidateQueue->push(currNode->left);\n            if(currNode->right != NULL)\n                candidateQueue->push(currNode->right);\n            if(currQueue->empty()){\n                \/\/swap curr and candidte\n                results.push_back(levelResult);\n                levelResult.clear();\n                queue<TreeNode*>* temp = currQueue;\n                currQueue = candidateQueue;\n                candidateQueue = temp;\n            }\n        }\n        return results;\n    }\n};<\/pre>\n
 <\/p>\n","protected":false},"excerpt":{"rendered":"
\u7ec3\u624b\u6c34\u9898\uff0c\u76f4\u63a5\u8d34\u4ee3\u7801\u3002\u5feb\u8f6c\u6b63\u9762\u8bd5\u4e86\uff0c\u865a\u554a\uff0c\u9b3c\u6653\u5f97BOSS\u4f1a\u95ee\u70b9\u4ec0\u4e48\u3002 \/** * Definition for a binary tree node. * 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>> results; if(root == NULL) return results; queue<TreeNode*>* currQueue = new queue<TreeNode*>(); queue<TreeNode*>* candidateQueue […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[8],"tags":[27,133],"class_list":["post-2154","post","type-post","status-publish","format-standard","hentry","category-technical","tag-bst","tag-133"],"_links":{"self":[{"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=\/wp\/v2\/posts\/2154","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=2154"}],"version-history":[{"count":0,"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=\/wp\/v2\/posts\/2154\/revisions"}],"wp:attachment":[{"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=2154"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=2154"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/dayandcarrot.space\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=2154"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}