Binary Tree Inorder Traversal

最新推荐文章于 2022-03-31 17:31:26 发布

真水壶

最新推荐文章于 2022-03-31 17:31:26 发布

阅读量387

点赞数

分类专栏： leetcode 文章标签：二叉树

本文链接：https://blog.csdn.net/enjoyuseless/article/details/19327691

版权

leetcode 专栏收录该内容

154 篇文章 0 订阅

订阅专栏

/**
 * 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> inorderTraversal(TreeNode *root) {
        vector<int> ret;
		if(0==root)	return ret;
		stack<TreeNode *> helpStack;
		TreeNode *pNode=root;
		while(!helpStack.empty() || pNode)
		{
			if(pNode)
			{
				helpStack.push(pNode);
				pNode=pNode->left;
			}
			else
			{
				pNode=helpStack.top();
				ret.push_back(pNode->val);
				pNode=pNode->right;
				helpStack.pop();
			}
		}
		return ret;
    }
};