二叉树之中序遍历的递归和迭代实现

最新推荐文章于 2023-02-22 22:41:43 发布

hustlx

最新推荐文章于 2023-02-22 22:41:43 发布

阅读量803

点赞数

分类专栏： c/c++

本文链接：https://blog.csdn.net/HUSTLX/article/details/51303538

版权

c/c++ 专栏收录该内容

28 篇文章 0 订阅

订阅专栏

迭代 --- O(n) time and O(n) space;
递归 --- O(n) time and O(n) space ;
Morris traversal --- O(n) time and O(1) space!!!

迭代算法：

vector<int> inorderTraversal(TreeNode* root) {
	vector<int> res;
	std::stack<TreeNode*> stn;
	while (root || !stn.empty()) {
		while (root) {
			stn.push(root);
			root = root->left;
		}
		root = stn.top(); stn.pop();
		res.push_back(root->val);
		root = root->right;
	}
	return res;
}

递归实现：

vector<int> res;
vector<int> inorderTraversal(TreeNode* root) {
	if (root) {
		inorderTraversal(root->left);
		res.push_back(root->val);
		inorderTraversal(root->right);
	}
	return res;
}

Morris traversal:

vector<int> inorderTraversal(TreeNode* root) {
    TreeNode* curNode = root;
    vector<int> nodes;
    while (curNode) {
        if (curNode -> left) {
            TreeNode* predecessor = curNode -> left;
            while (predecessor -> right && predecessor -> right != curNode)
                predecessor = predecessor -> right;
            if (!(predecessor -> right)) {
                predecessor -> right = curNode;
                curNode = curNode -> left;
            }
            else {
                predecessor -> right = NULL;
                nodes.push_back(curNode -> val);
                curNode = curNode -> right;
            }
        }
        else {
            nodes.push_back(curNode -> val);
            curNode = curNode -> right;
        }
    }
    return nodes;
}