# 144 Binary Tree Preorder Traversal

Given a binary tree, return the preorder traversal of its nodes' values.

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

```
   1
    \
     2
    /
   3
```

return \[1,2,3]. Note: Recursive solution is trivial, could you do it iteratively?

* A stack will naturally preserve the pre-order, in a very similiar way that level order used a queue. A stack will prioritize elements that come from the left FIRST, before the right.

// iteratively

```cpp
vector<int> preorderTraversal(TreeNode* root) {
    vector<int> pre_order;
    if (!root) return pre_order;
    stack<TreeNode*> s;
    s.push(root);

    while (!s.empty()) {
        TreeNode *temp = s.top();
        pre_order.push_back(temp->val);
        s.pop();

        if (temp->right) s.push(temp->right);
        if (temp->left) s.push(temp->left);
    }

    return pre_order;
}
```

// recursively

```cpp
// LDR
vector<int> pre_order;
vector<int> preorderTraversal(TreeNode* root) {
    if (root != nullptr) {
        pre_order.push_back(root->val);
        preorderTraversal(root->left);
        preorderTraversal(root->right);
    }
    return pre_order;
}
```


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/144_binary_tree_preorder_traversal.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.