Given the root of a binary tree, your task is to return a list containing the values of its nodes in preorder traversalIn preorder traversal, we visit each node by first visiting the current node, then its left subtree, and finally its right subtree order.

Constraints:

• The number of nodes in the tree is in the range $[0, 100]$.

• $-100 \leq$ node.data $\leq 100$ ...