4. USE THE FOLLOWING BINARY SEARCH TREE FOR PARTS (a) – (d): F D H K M R (a) Write the inorder traversal of the binary tree above. (b) Write the preorder traversal of the binary tree above. (c) Write the postorder traversal of the binary tree above. (d) Draw the tree after the node containing M is removed. T W

Traversal 1. Draw the binary search tree that results from inserting the numbers below starting with 70 and ending with 62. (70 11 47 81 20 61 10 12 13 62)2. For the tree above, list the nodes in a preorder, postorder and inorder traversalPreorder: Postorder:Inorder:3. Redraw tree after deleting 11

Please help with C++ question in image. Thank you.

Please provide code in Python Language design algorithms for the following operations for a binary tree T: preorder next(p): Return the position visited after p in a preorder traversal of T (or None if p is the last node visited). inorder next(p): Return the position visited after p in an inorder traversal of T(or None if p is the last node visited).

Please help with d, , and f

4. Draw the binary search tree whose root node is the 7th and 8th digit of your id i.e. ID: 2221078842, the root node is 88, and elements are inserted in the following order. 52 75 93 97 105 28 13 11 9 2 10 25 19 54 16 18 95 Print the elements of the tree after deleting nodes 9, 2, 25. Now insert new nodes 22, 100 and print the elements in the tree (postorder). [Just write the main.cpp must use the class included in your final syllabus to solve this problem]

10

Consider the following tree: Node 1. Perform the post-order tree traversal. 2. Complete the below-given table. A M J D E Children F Parent H K P M (N) Ancestor(s) Descendent(s)

Create a binary linked tree, and traverse the tree by using the recursive function. The structure of the tree is as follows: //check pic//  You should input the nodes in pre-order sequence. If a child of a node is NULL, input a space. Write the function of create binary tree, pre-order to print the nodes, in-order to print the nodes and post-order to print the nodes. Count the height of the tree.   Hints: Header file typedef char ElemType;   typedef struct node//define the type of binary tree node {                                       }BTnode;       Source file #include <stdio.h> #include <stdlib.h> #include "tree.h"   BTnode * createTree()//create the binary tree，return the root {             BTnode *tnode;// tnode is the root             char elem;                                ;//input the character                            //if the input is a space，set the pointer as NULL               Else// if the input is not a space，generate the binary node and create its left…

Consider the following Binary Tree. root A B D E F C G H K If we perform an postorder traversal, which value is displayed FOURT Enter the node's label (A,B,C,D,E,F,G,H,K) in the space provided.