Please implement the followings: 1. Create the binary tree with 9 nodes (Figure 1) by using pointer-based representation. struct TreeNode { int info; TreeNode * left; TreeNode * right; } 2. Implement...

Please implement the followings:

1. Create the binary tree with 9 nodes by using pointer-based representation. struct TreeNode { int info; TreeNode * left; TreeNode * right; }

2. Implement pre-order, in-order, and post-order traversals, and print the results of the tree (Figure 1). 2 7 5 2 6 9 5 11 4

(Figure 1 and question in image below). Please help.

Extracted text: Please implement the followings: 1. Create the binary tree with 9 nodes (Figure 1) by using pointer-based representation. struct TreeNode { int info; TreeNode * left; TreeNode * right; } 2. Implement pre-order, in-order, and post-order traversals, and print the results of the tree (Figure 1). 2 7 5 2 6 9 5 (11 4 Figure 1 Sample Run: Part 1 The pre-order transversal looks like this: The in-order transversal looks like this: The post-order transversal looks like this: 2 7 2 6 5 11 5 9 4 2 7 5 6 11 2 5 4 9 2 5 11 6 7 4 9 5 2