Given a binary tree, return the inorder traversal of its nodes' values.
For example:
Given binary tree {1,#,2,3}
,
1 \ 2 / 3
return [1,3,2]
.
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> res;
vector<int> inorderTraversal(TreeNode *root) {
if(root==NULL)return res;
if((root->left)!=NULL)inorderTraversal(root->left);
res.push_back(root->val);
if((root->right)!=NULL)inorderTraversal(root->right);
return res;
}
};
非递归算法:
还是用栈,和前序遍历时的差别是弹出一个节点,并不是立刻把这个节点的值计入结果中,而是先看看如果这个节点没有左子树,如果没有左子树那么将值计入结果,然后将右子树push进栈,如果这个节点有左子树,则按照右子树-根节点-左子树的顺序push进栈。只不过这次push的根节点改成一个没有儿子的叶子节点(我们只需要他的值)。
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
#include<stack>
class Solution {
public:
vector<int> inorderTraversal(TreeNode *root) {
vector<int> result;
if(root==NULL)return result;
stack<TreeNode*> st;
st.push(root);
TreeNode* tmp=NULL;
while(!st.empty())
{
TreeNode* node=st.top();
st.pop();
if((node->left)==NULL)
{
result.push_back(node->val);
if((node->right)!=NULL)st.push(node->right);
}
else
{
if((node->right)!=NULL)st.push(node->right);
tmp=node->left;
(node->left)=NULL;
(node->right)=NULL;
st.push(node);
st.push(tmp);
}
}
return result;
}
};