Build your intuition. Fill in the missing part by typing it in.

Tree traversal refers to the process of visiting or exploring every node of a tree data structure. It allows us to access the data stored in the tree in a specific order.

There are three main types of tree traversal techniques: 1. Inorder Traversal: In this traversal, we first traverse the left subtree, then visit the root node, and finally traverse the right subtree. 2. Preorder Traversal: In this traversal, we first visit the root node, then traverse the left subtree, and finally traverse the right subtree. 3. Postorder Traversal: In this traversal, we first traverse the left subtree, then traverse the right subtree, and finally visit the root node.

Understanding tree traversal techniques is essential for various algorithms and operations on trees, such as searching, inserting, or deleting nodes.

In the previous lesson, we saw an example of performing an inorder traversal on a binary tree.

Now, let's try a fill in the blank question:

In a preorder traversal, the order of visiting the nodes is _, then traverse the left subtree, and finally traverse the right subtree.

Please fill in the blank with the correct answer.