LeetCode OJ 之 Binary Tree Inorder Traversal (二叉树的中序遍历)
2014-12-17 09:32
537 查看
题目:
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?
思路:
二叉树的非递归遍历可以参考:http://blog.csdn.net/u012243115/article/details/40615603。递归版代码:
/*** 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> result;
inorderTraversal(root,result);
return result;
}
void inorderTraversal(TreeNode *root , vector<int> &result)
{
if(root == NULL)
return ;
inorderTraversal(root->left,result);
result.push_back(root->val);
inorderTraversal(root->right,result);
}
};
非递归版代码:
/*** 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> result;
stack<TreeNode *> stk;
TreeNode *p = root;
//循环结束条件是p为空且栈为空
while( p != NULL || !stk.empty())
{
//如果当前结点非空,则入栈,下次遍历左孩子
if(p != NULL)
{
stk.push(p);
p = p->left;
}
//如果当前结点为空,出栈,遍历右孩子
else
{
p = stk.top();
stk.pop();
result.push_back(p->val);
p = p->right;
}
}
return result;
}
};
相关文章推荐
- LeetCode OJ:Binary Tree Inorder Traversal(中序遍历二叉树)
- LeetCode OJ:Construct Binary Tree from Preorder and Inorder Traversal(从前序以及中序遍历结果中构造二叉树)
- leetcode 题解:Binary Tree Inorder Traversal (二叉树的中序遍历)
- LeetCode 94 Binary Tree Inorder Traversal(二叉树的中序遍历)+(二叉树、迭代)
- LeetCode:BInary Tree Inorder Traversal(二叉树的中序遍历)
- LeetCode—***Binary Tree Inorder Traversal二叉树的中序遍历
- LeetCode(Construct Binary Tree from Preorder and Inorder Traversal )根据二叉树的中序遍历和后序遍历重建二叉树
- LeetCode OJ:Construct Binary Tree from Inorder and Postorder Traversal(从中序以及后序遍历结果中构造二叉树)
- LeetCode-94-Binary Tree Inorder Traversal 中序遍历二叉树
- 【遍历二叉树】02二叉树的中序遍历【Binary Tree Inorder Traversal】
- lintcode 容易题:Binary Tree Inorder Traversal 二叉树的中序遍历
- [线索二叉树] [LeetCode] 不需要栈或者别的辅助空间,完成二叉树的中序遍历。题:Recover Binary Search Tree,Binary Tree Inorder Traversal
- [leetcode]Construct Binary Tree from Inorder and Postorder Traversal (利用中序遍历和后续遍历确定一颗二叉树)
- LeetCode | Binary Tree Inorder Traversal(二叉树的中序遍历)
- LintCode Binary Tree Inorder Traversal 二叉树的中序遍历(非递归)
- 二叉树的中序遍历 Binary Tree Inorder Traversal
- Leetcode - Tree - 106. Construct Binary Tree from Inorder and Postorder Traversal(根据中序遍历和后序遍历重构二叉树)
- [leetcode]Construct Binary Tree from Preorder and Inorder Traversal(根据前序、中序遍历确定一棵二叉树 C语言)
- LeetCode Binary Tree Inorder Traversal 中序遍历二叉树
- Binary Tree Inorder Traversal 二叉树的中序遍历(C++:Iterative solution using stack)