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?
Given the root of a binary tree, return the inorder traversal of its nodes' values. Example 1: Input: root = [1,null,2,3] Output: [1,3,2] Example 2: Input: root = [] Output: [] Example 3: Input: root = [1] Output: [1] Constraints: The number of nodes in the tree is...
* 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; inorder(root, result);returnresult; }voidinorder(TreeNode *cur, vector<int>...
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 ...
vector<int> inorderTraversal(TreeNode* root) { vector<int> res; inorder(res,root); return res; } private: void inorder(vector<int>& res,TreeNode* root){ if(root==NULL) return; inorder(res,root->left); res.push_back(root->val); ...
Given a binary tree, return theinordertraversal of its nodes' values. For example: Given binary tree{1,#,2,3}, 1 \ 2 / 3 1. 2. 3. 4. 5. return[1,3,2]. 1 /** 2 * Definition for binary tree 3 * struct TreeNode { ...
每天一算:Binary Tree Inorder Traversal 程序员吴师兄 + 关注 预计阅读时间2分钟 6 年前 LeetCode上第94 号问题:二叉树的中序遍历 题目 给定一个二叉树,返回它的 中序 遍历。 示例: 输入: [1,null,2,3] 输出: [1,3,2] 进阶: 递归算法很简单,你可以通过迭代算法完成吗? 解题思路 用栈(Stack)的...
* TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */classSolution{public List<Integer>preorderTraversal(TreeNode root){List<Integer>result=newLinkedList<>();TreeNode current=root;TreeNode prev=null;while(current!=null){if(current.left==null){result.add(current....
Same Tree -https://leetcode.com/problems/same-tree/ Invert/Flip Binary Tree -https://leetcode.com/problems/invert-binary-tree/ Binary Tree Maximum Path Sum -https://leetcode.com/problems/binary-tree-maximum-path-sum/ Binary Tree Level Order Traversal -https://leetcode.com/problems/binary-...
名字叫做, 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...