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...
def inOrderRecur(self,head: TreeNode) -> int: """ 递归遍历,LNR, 左根右 :param head: :return: """ def traversal(head): # 递归终止条件 ifhead== None: return traversal(head.left) print(head.val +" ") res.append(head.val) traversal(head.right) res = [] traversal(head) returnres...
* 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 ...
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; ...
Binary Tree Level Order Traversal Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example: Given binary tree [3,9,20,null,null,15,7], 代码语言:javascript ...
*/classSolution{public List<Integer>inorderTraversal(TreeNode root){List<Integer>result=newLinkedList<>();TreeNode current=root;TreeNode prev=null;while(current!=null){// left firstif(current.left==null){result.add(current.val);current=current.right;}// if there is left, get the rightmost...
* TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */publicclassSolution{public List<Integer>inorderTraversal(TreeNode root){ArrayList<Integer>result=newArrayList<Integer>();if(root==null)returnresult;inorderTraversal(root,result);returnresult;}privatevoidinorderTraversal...
Unfortunately, the .NET Framework does not contain a binary tree class, so in order to better understand binary trees, let's take a moment to create our own binary tree class. The First Step: Creating a Base Node Class The first step in designing our binary tree class is to create a ...
Unfortunately, the .NET Framework does not contain a binary tree class, so in order to better understand binary trees, let's take a moment to create our own binary tree class. The First Step: Creating a Base Node Class The first step in designing our binary tree class is to create a ...