Please help with the 3 short c++ questions. Thanks!

What is the postorder traversal for this tree? (use spaces to separate numbers in the answer) 12 6 81 10 2 3 What is the inorder traversal output for this tree? (use spaces to separate numbers in the answer) 3 6 8 15 Given the binary search tree below, show the order that nodes are visited in searching for a value of 45. You do not need to include any node that is NULL. You must write your answer in the order that the nodes are visited. For example, Order of nodes visited: Node 15 means to evaluate the node with a value of 15 first. 15 60 70 30 20 50 40 45 35 Order of nodes visited Node 15