Given a binary tree, return the inorder traversal of its nodes' values. For example: Given binary tree [1,null,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>ret;if( !root )returnret; stack<TreeNode*>sta; sta.push(root);while( !sta.empty...
* @param root: A Tree * @return: Inorder in ArrayList which contains node values. */vector<int>inorderTraversal(TreeNode * root){// write your code herevector<int> result; traverse(root, result);returnresult; }// 遍历法的递归函数,没有返回值,函数参数result贯穿整个递归过程用来记录遍历的结...
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 ...
12 vector<int> inorderTraversal(TreeNode *root) { 13 vector<int> res; 14 if(root==NULL) return res; 15 stack<TreeNode*> s; 16 TreeNode* cur=root; 17 while(cur||!s.empty()){ 18 while(cur!=NULL){ 19 s.push(cur); 20 cur=cur->left; ...
Given a binary tree, return the inorder traversal of its nodes' values. For example: Given binary tree [1,null,2,3], 1 \ 2 / 3 return [1,3,2]. Note: Recursive solution is trivial, could you do it iteratively? 1. 2. 3. ...
Binary Tree Maximum Path Sum -https://leetcode.com/problems/binary-tree-maximum-path-sum/ Binary Tree Level Order Traversal -https://leetcode.com/problems/binary-tree-level-order-traversal/ Serialize and Deserialize Binary Tree -https://leetcode.com/problems/serialize-and-deserialize-binary-tree/...
* 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.val);current=current.right;}else{// ...
名字叫做, 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...
https://leetcode.com/problems/binary-tree-inorder-traversal/ 题意 二叉树的中序遍历 代码(递归,C++) 其中函数返回类型不符合题目中要求,做相应更改即可A; /** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; ...