PLEASE ZOOM IN TO VIEW QUESTION

USE C LANGUAGE

Please solve task 1 and 2

Please provide screenshot of input and output

Tasks: Figure 1. Binary Search Tree Task 1: Write a program which can perform: i. Node insertion to create the following BST ii. Tree Traversals; pre-order, in order, and post-order. Task 2: i. Using the program in Task 1, create the tree in Figure 1. ii Print the three traversals Discussion: 1. Explain the algorithms of insertion and traversals in BST 2. Explain the implementation of your codes: i.e. variables and statements used