問題
https://leetcode.com/problems/binary-tree-inorder-traversal/
https://leetcode.com/problems/binary-tree-postorder-traversal/
https://leetcode.com/problems/binary-tree-preorder-traversal/
解法
http://www.cnblogs.com/AnnieKim/archive/2013/06/15/morristraversal.html
Inorder 時間複雜度 3N 空間複雜度 O(1)
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
vector<int> inorderTraversal(TreeNode* root) {
vector<int> ret;
TreeNode* cur = root;
while(cur != NULL)
{
if (cur->left == NULL)
{
ret.push_back(cur->val);
cur = cur->right;
}
else
{
TreeNode * pre = cur->left;
while(pre->right != NULL && pre->right != cur)
pre = pre->right;
if (pre->right == NULL)
{
pre->right = cur;
cur = cur->left;
}
else
{
pre->right = NULL;
ret.push_back(cur->val);
cur = cur->right;
}
}
}
return ret;
}
};
Preorder 時間複雜度 3N 空間複雜度 O(1)
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
vector<int> preorderTraversal(TreeNode* root) {
vector<int> ret;
TreeNode *cur = root;
while(cur != NULL)
{
if (cur->left == NULL)
{
ret.push_back(cur->val);
cur = cur->right;
}
else
{
TreeNode * pre = cur->left;
while(pre->right != NULL && pre->right != cur)
pre = pre->right;
if (pre->right == NULL)
{
ret.push_back(cur->val);
pre->right = cur;
cur = cur->left;
}else
{
pre->right = NULL;
cur = cur->right;
}
}
}
return ret;
}
};