leetcode 102. Binary Tree Level Order Traversal (medium)

水题 dfs 搜索时加个层数变量，根据层数加入到结果容器中

class Solution
{
  public:
	vector<vector<int>> levelOrder(TreeNode *root)
	{
		vector<vector<int>> res;
		helpr(root, res, 1);
		return res;
	}
	void helpr(TreeNode *node, vector<vector<int>> &res, int layer)
	{
		if (node == nullptr)
			return;
		if (layer > res.size())
			res.push_back({});
		res[layer - 1].push_back(node->val);
		helpr(node->left, res, layer + 1);
		helpr(node->right, res, layer + 1);
	}
};