> For the complete documentation index, see [llms.txt](https://protegejj.gitbook.io/algorithm-practice/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://protegejj.gitbook.io/algorithm-practice/leetcode/tree/144-binary-tree-preorder-traversal.md).

# 144 Binary Tree Preorder Traversal

## 144. Binary Tree Preorder Traversal

## 1. Question

Given a binary tree, return thepreordertraversal of its nodes' values.

For example:\
Given binary tree`{1,#,2,3}`,

```
   1
    \
     2
    /
   3
```

return`[1,2,3]`.

## 2. Implementation

**(1) Morris Tree Traversal**

```java
class Solution {
    public List<Integer> preorderTraversal(TreeNode root) {
        List<Integer> res = new ArrayList<>();

        if (root == null) {
            return res;
        }

        TreeNode curNode = root, preNode = null;
        while (curNode != null) {
            if (curNode.left == null) {
                res.add(curNode.val);
                curNode = curNode.right;
            }
            else {
                preNode = curNode.left;
                while (preNode.right != null && preNode.right != curNode) {
                    preNode = preNode.right;
                }

                if (preNode.right == null) {
                    res.add(curNode.val);
                    preNode.right = curNode;
                    curNode = curNode.left;
                }
                else {
                    preNode.right = null;
                    curNode = curNode.right;
                }
            }
        }
        return res;
    }
}
```

**(2) Iteration**

```java
class Solution {
    public List<Integer> preorderTraversal(TreeNode root) {
        List<Integer> res = new ArrayList<>();

        if (root == null) {
            return res;
        }

        Stack<TreeNode> stack = new Stack<>();
        stack.push(root);
        TreeNode curNode = null;

        while (!stack.isEmpty()) {
            curNode = stack.pop();
            res.add(curNode.val);

            if (curNode.right != null) {
                stack.push(curNode.right);
            }

            if (curNode.left != null) {
                stack.push(curNode.left);
            }
        }
        return res;
    }
}
```

## 3. Time & Space Complexity

**(1) Morris Tree Traversal:** 时间复杂度: O(n), 空间复杂度: O(1)

**(2) Iteration:** 时间复杂度: O(n), 空间复杂度: O(h)