Subject. Data structure.

I need the code in pre order traversal.

Please dont copy from the online. Run the code & send the code with output.

Send me a copyable code. So I can paste & run easily.

Take your time. Thanks

You can follow this book in online.

3. [40 points] Chapter 8: Implement an algorithm that will perform a preorder traversal of a binary tree. You can use the Tree class provided in Chapter 8. You should hard code the arithmetic expression tree from Figure 8.6 in Chapter 8 in the book, and your program should output the proorder traversal of that tree. You should treat all nodes as Strings. You program should be called preorderTraversal