Binary Tree Preorder Traversal

You are given the **root** of a binary tree. Your task is to return the preorder traversal of the tree. In preorder traversal, visit the root node first, then recursively traverse the left subtree followed by the right subtree.

Please log in to access the Submissions tab, where you can review your progress and explore code submissions from other participants.

Please log in to access the Solution tab and view detailed answers and explanations.

Please log in to access the Discussion tab and join conversations with other participants.