LeetCode: Binary Tree Inorder Traversal [094]
来源:互联网 发布:网络租用合同范本 编辑:程序博客网 时间:2024/06/07 04:48
【题目】
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.
【题意】
用非递归的方法实现二叉树的中序遍历。【思路】
中序遍历是先访问左子树,然后访问根节点,最后访问右子树。利用栈来实现:
1. 首先从根节点开始沿左孩子不断入栈
2. 访问栈顶元素,弹出栈顶元素,然后从该元素的右子树的根节点开始沿左孩子不断入栈
3. 重复步骤2,直到栈为空
【代码】
/** * 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*>st; TreeNode*node=root; //左孩子不断入栈 while(node){st.push(node); node=node->left;} while(!st.empty()){ //访问栈顶元素 node=st.top(); st.pop(); result.push_back(node->val); node=node->right; //右子树的左孩子不断入栈 while(node){st.push(node); node=node->left;} } return result; }};
0 0
- LeetCode 094 Binary Tree Inorder Traversal
- LeetCode: Binary Tree Inorder Traversal [094]
- LeetCode 094 Binary Tree Inorder Traversal
- leetcode 094 Binary Tree Inorder Traversal
- LeetCode: Binary Tree Inorder Traversal
- [LeetCode]Binary Tree Inorder Traversal
- LeetCode Binary Tree Inorder Traversal
- [Leetcode] Binary Tree Inorder Traversal
- Leetcode: Binary Tree Inorder Traversal
- LeetCode Binary Tree Inorder Traversal
- LeetCode : Binary Tree Inorder Traversal
- [Leetcode] Binary Tree Inorder Traversal
- 【leetcode】Binary Tree Inorder Traversal
- [LeetCode]Binary Tree Inorder Traversal
- Leetcode: Binary Tree Inorder Traversal
- [leetcode]Binary Tree Inorder Traversal
- LeetCode-Binary Tree Inorder Traversal
- Leetcode Binary Tree Inorder Traversal
- Linux下终端怎么进去Root
- Lasso算法简介
- 清寂雅韵话时光
- LeetCode: Restore IP Addresses [093]
- 插入排序:二路插入
- LeetCode: Binary Tree Inorder Traversal [094]
- hard k-means and soft k-means
- 杭电1276 士兵训练问题
- HDU2089 数位DP入门题
- 使用C++实现学生管理系统
- JAVA基础_无限循环
- LeetCode: Unique Binary Search Trees [095]
- 虚拟化相关源码项目地址
- JDK的动态代理机制