binary-tree-inorder-traversal /** * * @author gentleKay * 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?
* int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * };*/classSolution {public: vector<int> inorderTraversal(TreeNode*root) { vector<int>result; stack<TreeNode *>s; TreeNode*p =root;while(!s.empty() || p !=nullptr)...
2.2 last.right 不为 null,说明之前已经访问过,第二次来到这里,表明当前子树遍历完成,保存 cur 的值,更新 cur = cur.right public List<Integer> inorderTraversal3(TreeNode root) { List<Integer> ans = new ArrayList<>(); TreeNode cur = root; while (cur != null) { //情况 1 if (cur.left ...
public: vector<int> inorderTraversal(TreeNode* root) { vector<int> res; stack<TreeNode*> treeroot; while(root!=NULL||!treeroot.empty()) { while(root!=NULL) { treeroot.push(root); root=root->left; } root = (); treeroot.pop(); res.push_back(root->val); root = root->right;...
94. Binary Tree Inorder Traversal 两种解法,递归和迭代 Memory分别是6.1和5.7,速度好像是一样的。。 Recursive class Solution { public: vector<int>res; void in_order(TreeNode* root) { if (!root)return; in_order(root->left); res.push_back(root->val);...
https://leetcode.com/problems/binary-tree-inorder-traversal/Given a binary tree, return the inorder traversal of its nodes' values.给定一个二叉树,返回 中序遍历后所有节点的值。 Example:Input: [1…
每天一算:Binary Tree Inorder Traversal 程序员吴师兄 + 关注 预计阅读时间2分钟 6 年前 LeetCode上第94 号问题:二叉树的中序遍历 题目 给定一个二叉树,返回它的 中序 遍历。 示例: 输入: [1,null,2,3] 输出: [1,3,2] 进阶: 递归算法很简单,你可以通过迭代算法完成吗? 解题思路 用栈(Stack)的...
树的三种DFS遍历,是指按照根节点(自己)被访问的顺序 Pre-Order: 先访问根节点,再访问其左右子树。对每一个subtree,同样适用。 In-Order: 先访问其...
名字叫做, morrois traversal, 自己写了下: My code: /** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */publicclassSolution{publicList<Integer>inorderTraversal(TreeNoderoot){List...
Binary tree traversal: Preorder, Inorder, and Postorder In order to illustrate few of the binary tree traversals, let us consider the below binary tree: Preorder traversal: To traverse a binary tree in Preorder, following operations are carried-out (i) Visit the root, (ii) Traverse the le...