Data trees, Computer science, Python

CSCA48 Week 5: Worksheet Before you answer the questions, traverse the following trees using pre-order, in-order and post-order traversal individually and then verify your answer with people around you. If you got it right, start answering the questions Question 1: Draw a binary tree that stores a character in each node (including the letters in the alphabet I, or blank and satisfies the followings simultaneously: Post-order: ZH EIRAOK! SCRM In-order: ZRIHE AMORKC!S When you finished, travers it by pr-odaversal method and write the result in the worksheet Question 2: Draw the binary search tree that we would get if we insert the following numbers in the order that they arrive from left to right. 23 45 50 12 34 78 23 45 67 89 15 7 44 46 16 72 10 Traverse the tree using BFS and write down your answer in the worksheet. Remove the node that contains 50, traverse the resulted tree usinE BFS and write down your answer in the worksheet