Given a binary tree, its return in order traversal.
Example:
Input: [. 1, null, 2,3] . 1 \ 2 / . 3 Output: [1,3,2]
Advanced: recursive algorithm is very simple, you can do it through an iterative algorithm?
Recursion:
public List<Integer> inorderTraversal(TreeNode root) {
List<Integer> result = new ArrayList<>();
if (root == null) {
return result;
}
result.addAll(inorderTraversal(root.left));
result.add(root.val);
result.addAll(inorderTraversal(root.right));
return result;
}
Non-recursive:
/**
* 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> result = new ArrayList<>();
if (root == null) {
return result;
}
Stack<TreeNode> stack = new Stack<>();
TreeNode curNode = root;
while (!stack.isEmpty() || curNode != null) {
if (curNode != null) {
stack.push(curNode);
curNode = curNode.left;
} else {
curNode = stack.pop();
result.add(curNode.val);
curNode = curNode.right;
}
}
return result;
}
}