题目
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?
confused what "{1,#,2,3}"
means? > read more on how binary tree is serialized on OJ.
OJ's Binary Tree Serialization:
The serialization of a binary tree follows a level order traversal, where '#' signifies a path terminator where no node exists below.
Here's an example:
1 / \ 2 3 / 4 \ 5The above binary tree is serialized as
"{1,2,3,#,#,4,#,#,5}"
.
解题思路
中序遍历的顺序为:“左为上,根次之,右为下”。递归的算法很容写出来,消除递归的一个常用武器就是stack。使用stack保存相对当前节点的所有靠右节点。依次访问所有节点的左节点,然后再访问这个节点,最后访问所有节点的靠右节点。
代码实现
vector<int> inorderTraversal(TreeNode *root) {
vector<int> ret;
if(root == NULL) return ret;
std::stack<TreeNode *> s;
TreeNode *pNode = root;
while ( pNode!=NULL || s.empty()==false) {
if (pNode->left != NULL) {
s.push(pNode);
pNode = pNode->left;
} else {
ret.push_back(pNode->val);
pNode = pNode->right;
while (pNode == NULL && s.empty()==false) {
pNode = s.top();
s.pop();
ret.push_back(pNode->val);
pNode = pNode->right;
}
}
}
}
如果你觉得本篇对你有收获,请帮顶。
另外,我开通了微信公众号--分享技术之美,我会不定期的分享一些我学习的东西.
另外,我开通了微信公众号--分享技术之美,我会不定期的分享一些我学习的东西.
你可以搜索公众号:
swalge
或者扫描下方二维码关注我
(转载文章请注明出处: http://blog.csdn.net/swagle/article/details/38322899 )