题目描述
题目难度:Medium
Given a binary tree, return the inorder traversal of its nodes’ values.
(树的中序遍历)
AC代码1
递归解法
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public List<Integer> inorderTraversal(TreeNode root) {
List<Integer> resList = new ArrayList<Integer>();
inorderTraversalCore(root, resList);
return resList;
}
private void inorderTraversalCore(TreeNode root, List<Integer> list){
if(root == null) return;
inorderTraversalCore(root.left, list);
list.add(root.val);
inorderTraversalCore(root.right, list);
}
}
AC代码2
利用stack
class Solution {
public List<Integer> inorderTraversal(TreeNode root) {
List<Integer> result = new ArrayList<>();
Stack<TreeNode> stack = new Stack<>();
TreeNode curr = root;
while(curr != null || !stack.isEmpty()){
while(curr != null){
stack.push(curr);
curr = curr.left;
}
curr = stack.pop();
result.add(curr.val);
curr = curr.right;
}
return result;
}
}