LeetCode 102. Binary Tree Level Order Traversal

広く検索し、アクセスするノードを先進的なルールで維持します.
コード:

class Solution 
{
public:
    vector<vector<int> > levelOrder(TreeNode *root) 
    {
    	vector<vector<int>> ret;
        vector<TreeNode*> same_level_node[2];
		same_level_node[0].push_back(root);

        while (same_level_node[0].empty() == false)
        {
        	vector<int> num;
        	same_level_node[1].clear();
        	
        	for (size_t i = 0; i < same_level_node[0].size(); ++ i)
        	{
        		if (same_level_node[0][i] != NULL)
        		{
        			num.push_back( same_level_node[0][i]->val );
        			same_level_node[1].push_back( same_level_node[0][i]->left );
        			same_level_node[1].push_back( same_level_node[0][i]->right );
        		}
        	}
            if (num.size() != 0)
            {
            	ret.push_back(num);
            }
        	same_level_node[0] = same_level_node[1];
        }

        return ret;
    }
};