Can someone help with these two problems?

The following binary tree contains the characters 'A' through 'G' in its nodes. List the nodes in the order that they are visited by: A preorder traversal. An inorder traversal. A postorder traversal. The binary tree in Problem 2 is a Binary Search Tree since for every node, all elements stored in the left subtree of the node are smaller than the element in the node and all elements stored in the right subtree of the node are greater than the element in the node. Draw a different Binary Search Tree containing the same elements as in the tree in Problem 2