首页 > 代码库 > Binary Tree Postorder Traversal
Binary Tree Postorder Traversal
问题描述
Given a binary tree, return the postorder traversal of its nodes‘ values.
For example:
Given binary tree {1,#,2,3}
,
1
2
/
3
return [3,2,1]
.
Note: Recursive solution is trivial, could you do it iteratively?
解决方案
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class Solution { public: vector<int> postorderTraversal(TreeNode *root) { if( root == nullptr ) { return { }; } vector<int> result; stack<TreeNode*> nodeStack; nodeStack.push( root ); while( !nodeStack.empty() ) { auto t = nodeStack.top(); nodeStack.pop(); if( t != nullptr ) { result.push_back( t->val ); nodeStack.push( t->right ); nodeStack.push( t->left ); } } reverse( result.begin(), result.end() ); return result; } };
Binary Tree Postorder Traversal
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。