首页 > 代码库 > leetcode - Binary Tree Level Order Traversal II
leetcode - Binary Tree Level Order Traversal II
Given a binary tree, return the bottom-up level order traversal of its nodes‘ values. (ie, from left to right, level by level from leaf to root).
For example:
Given binary tree {3,9,20,#,#,15,7}
,
3 / 9 20 / 15 7
return its bottom-up level order traversal as:
[ [15,7], [9,20], [3] ]
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ struct TreeNode { int val; TreeNode *left; TreeNode *right; TreeNode(int x) : val(x), left(NULL), right(NULL) {} }; class Solution { public: std::vector<std::vector<int> > levelOrderBottom(TreeNode *root) { dfs(root,0); std::reverse(res.begin(),res.end()); return res; } private: std::vector<std::vector<int>> res; void dfs(TreeNode *root, int level) { if(root == NULL) return; if(level == res.size()) { res.push_back(std::vector<int>()); } res[level].push_back(root->val); dfs(root->left,level+1); dfs(root->right,level+1); } };
leetcode - Binary Tree Level Order Traversal II
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。