Suppose there is a binary tree as shown in the following example….

Question Answered step-by-step Suppose there is a binary tree as shown in the following example…. Suppose there is a binary tree as shown in the following example.Image transcription textA B C D E F I J K… Show moreBy utilizing the procedures and functions given in the theoretical slide about Trees, the lines of code in the main program that make up the tree are:      Knot *R;     inisialisasi(&R);     addKnot(&R, ‘A’);     addKnot(&R->left, ‘B’);     addKnot(&R->left->left, ‘D’);     addKnot(&R->left->right, ‘E’);     addKnot(&R->right, ‘C’);     addKnot(&R->right->left, ‘F’);     addKnot(&R->right->left->left, ‘I’);     addKnot(&R->right->left->left->left, ‘K’);     addKnot(&R->right->left>right, ‘J’); I. Add the program code to read the tree in preorder, inorder, and postorder.Copy your Python code here.  II.  Describe running results here and Show and explain the results of running the program here. build program code to build a tree like the following and display its contents in preorder, inorder and postorder.       III. Copy your Python code here.       IV.  Describe running results here and Show and explain the results of running the program here. build program code to build a tree like the following and display its contents in preorder, inorder and postorder. Modify the code you already have so that each node stores data as one integer (integer). V. Copy your Python code here. Describe the changes you made to accommodate the data contents in the form of integers. VI. Describe running results here and Show and explain the results of running the program here.   Computer Science Engineering & Technology C++ Programming TECHNOLOGY 11 Share QuestionEmailCopy link Comments (0)