145:Binary Tree Postorder Traversal【树】【栈】
2015-04-14 11:09
148 查看
题目链接：click~
/*题意：二叉树的后序遍历*/
class Solution {
public:
void PostOrderTraverse(TreeNode *T, vector<int> &v) {
if(T == NULL) return;
PostOrderTraverse(T->left, v);
PostOrderTraverse(T->right, v);
v.push_back(T->val);
}
vector<int> postorderTraversal(TreeNode *root) {
vector<int> v;
PostOrderTraverse(root, v);
return v;
}
};
/*题意：二叉树的后序遍历*/
class Solution {
public:
void PostOrderTraverse(TreeNode *T, vector<int> &v) {
if(T == NULL) return;
PostOrderTraverse(T->left, v);
PostOrderTraverse(T->right, v);
v.push_back(T->val);
}
vector<int> postorderTraversal(TreeNode *root) {
vector<int> v;
PostOrderTraverse(root, v);
return v;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- 【LeetCode-面试算法经典-Java实现】【145-Binary Tree Postorder Traversal（二叉树非递归后序遍历）】
- LeetCode: Binary Tree Postorder Traversal [145]
- Java for LeetCode 145 Binary Tree Postorder Traversal
- leetcode——145——Binary Tree Postorder Traversal
- [LeetCode145]Binary Tree Postorder Traversal
- LeetCode题解-145-Binary Tree Postorder Traversal
- 145. Binary Tree Postorder Traversal
- LeetCode 145 Binary Tree Postorder Traversal
- 145. Binary Tree Postorder Traversal
- leetcode(145):Binary Tree Postorder Traversal
- LeetCode No145 Binary Tree Postorder Traversal
- LeetCode145:Binary Tree Postorder Traversal
- Leetcode145: Construct Binary Tree from Inorder and Postorder Traversal
- [Leetcode 145, Hard] Binary Tree Postorder Traversal
- LeetCode 145 Binary Tree Postorder Traversal
- LeetCode_145 Binary Tree Postorder Traversal
- LeetCode 145 Binary Tree Postorder Traversal
- Lettcode_145_Binary Tree Postorder Traversal
- LC145 Binary Tree Postorder Traversal
- LeetCode 145: Binary Tree Postorder Traversal(二叉树的后序遍历，迭代法)