leetcode[94]Binary Tree Inorder Traversal

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.

/*** 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> res;if(root==NULL)return res;TreeNode *p=root;stack<TreeNode *> sta;while(p!=NULL||!sta.empty()){while(p!=NULL){sta.push(p);p=p->left;}if(!sta.empty()){p=sta.top();sta.pop();res.push_back(p->val);p=p->right;}}return res;
}
/*
void inorder(TreeNode *root, vector<int> &res)
{if(root==NULL)return;inorder(root->left,res);res.push_back(root->val);inorder(root->right,res);return;
}vector<int> inorderTraversal(TreeNode *root) {vector<int> res;inorder(root,res);return res;}
*/
};

转载于:https://www.cnblogs.com/Vae1990Silence/p/4281382.html

leetcode[94]Binary Tree Inorder Traversal相关推荐

【二叉树迭代版中序遍历】LeetCode 94. Binary Tree Inorder Traversal
LeetCode 94. Binary Tree Inorder Traversal Solution1:递归版二叉树的中序遍历递归版是很简单的,中序遍历的迭代版需要特殊记一下! 迭代版链接:htt ...
LeetCode 94. Binary Tree Inorder Traversal
94. Binary Tree Inorder Traversal Given a binary tree, return the inorder traversal of its nodes' va ...
[LeetCode]:94:Binary Tree Inorder Traversal
题目: Given a binary tree, return the inorder traversal of its nodes' values. For example: Given binar ...
[swift] LeetCode 94. Binary Tree Inorder Traversal
Given a binary tree, return the inorder traversal of its nodes' values. For example: Given binary tr ...
LeetCode 94. Binary Tree Inorder Traversal--二叉树中序遍历--递归，迭代--C++,Python解法
题目地址:Binary Tree Inorder Traversal - LeetCode Given a binary tree, return the inorder traversal of i ...
94. Binary Tree Inorder Traversal
题目: Given a binary tree, return the inorder traversal of its nodes' values. For example: Given binar ...
94. Binary Tree Inorder Traversal二叉树的中序遍历
网址:https://leetcode.com/problems/binary-tree-inorder-traversal/ 参考:https://leetcode.com/problems/bin ...
94 Binary Tree Inorder Traversal
递归的代码是以前数据结构书上常见的: public ArrayList<Integer> inorderTraversal(ConstructBinaryTreefromPostorder ...
94. Binary Tree Inorder Traversal 二叉树的中序遍历
给定一个二叉树,返回它的中序遍历. 示例: 输入: [1,null,2,3]1\2/3输出: [1,3,2] 进阶: 递归算法很简单,你可以通过迭代算法完成吗? 二叉树遍历不太想用递归,试试循环吧 ...

leetcode[94]Binary Tree Inorder Traversal

leetcode[94]Binary Tree Inorder Traversal相关推荐

最新文章

热门文章