实现二叉树的三种遍历
OJ 地址:实现二叉树的三种遍历
void dfs(TreeNode *root, vector<vector<int>> &res)
{
if(root)
{
res[0].push_back(root->val);
dfs(root->left, res);
res[1].push_back(root->val);
dfs(root->right, res);
res[2].push_back(root->val);
}
}
vector<vector<int> > threeOrders(TreeNode* root) {
// write code here
vector<vector<int> > res(3);
if(!root)
return res;
dfs(root, res);
return res;
}