【LeetCode】94. 二叉树的中序遍历

一、递归方法：

class Solution {
public:
	vector<int> inorderTraversal(TreeNode* root) {
		vector<int> res;
		vector<int> left;
		vector<int> right;
		if (root != NULL) {
			left = inorderTraversal(root->left);
			res.insert(res.end(), left.begin(), left.end());
			res.push_back(root->val);
			right = inorderTraversal(root->right);
			res.insert(res.end(), right.begin(), right.end());
		}
		return res;
	}
};

二、利用栈

class Solution {
public:
	vector<int> inorderTraversal(TreeNode* root) {
		vector<int> res;
		if (root == NULL) {
			return res;
		}
		stack<TreeNode*> Stack;
		set<TreeNode*> visited;
		Stack.push(root);//压入头结点
		TreeNode* node;//暂存
		while (!Stack.empty()) {
			node = Stack.top();
			//若左孩子存在且没有被访问过，压栈
			while (node->left != NULL && visited.find(node->left) == visited.end()) {
				Stack.push(node->left);
				node = node->left;
			}
			//访问节点并弹出
			res.push_back(node->val);
			visited.insert(node);
			Stack.pop();
			//若右孩子存在(右孩子不会重复访问)
			if (node->right != NULL) {
				Stack.push(node->right);
			}
		}
		return res;
	}
};