趁热打铁顺便把后续遍历也刷了,其实前序、中序和后续遍历在代码表现上差别不是很大,下面来分享一下经验。
题目如下:
Given a binary tree, return the postorder traversal of its nodes' values.
Example:
Input: [1,null,2,3]
1
\
2
/
3
Output: [3,2,1]
Follow up: Recursive solution is trivial, could you do it iteratively?
题意分析:
给定一个二分搜索树,返回后序遍历后节点的值。如果不使用递归方法,用其他的方法呢?
解答如下:
方法一(递归法)
和“https://blog.csdn.net/Vensmallzeng/article/details/88907167”的方法一思想一样,只是将res.push_back( node -> val ); 操作的位置换一下。
class Solution{
public:
vector<int> postorderTraversal( TreeNode* node ){
vector<int> res;
if( !node )
return res;
recursive(node, res);
return res;
}
void recursive( TreeNode* node, vector<int>& res ){
if( node )
{
recursive( node -> left, res);
recursive( node -> right, res);
res.push_back( node -> val ); //此处操作便为中序遍历
}
}
};
提交后的结果如下:
方法二(非递归法)
和“https://blog.csdn.net/Vensmallzeng/article/details/88907167”的方法二思想一样,只是将stack.push( Instruction( "Out", instruction.node ) ); 操作的位置换一下。
struct Instruction{
string s;
TreeNode* node;
Instruction(string s, TreeNode* node): s(s), node(node){}
};
class Solution{
public:
vector<int> postorderTraversal( TreeNode* node ){
vector<int> res;
if ( !node ) return res;
stack<Instruction> stack;
stack.push( Instruction("Go", node) );
while ( !stack.empty() ){
Instruction instruction = stack.top();
stack.pop();
if ( instruction.s == "Out" ) res.push_back( instruction.node->val );
else{
assert( instruction.s == "Go" );
stack.push( Instruction( "Out", instruction.node ) ); // 此处操作便为后序遍历
if ( instruction.node -> right )
stack.push( Instruction( "Go", instruction.node->right ));
if ( instruction.node -> left )
stack.push( Instruction( "Go", instruction.node->left ));
}
}
return res;
}
};
提交后的结果如下:
日积月累,与君共进,增增小结,未完待续。