Draw out a Binary Search Tree of the following nodes if they are inserted in this order. Start with 44 as the root: 44, 17, 88, 8, 32, 65, 28, 21, 29, 54, 97, 82, 76, 93, 80

In a binary search tree, to remove a node N that has left child C1 and right child C2, we do the following:   Group of answer choices We make C1 the left child of N’s parent and C2 the right child of N’s parent   We make C1 the right child of N’s parent and C2 the left child of N’s parent   We find the largest item L in N’s left subtree, copy the contents of L to N, and remove L   We find the smallest item S in N’s right subtree, copy the contents of S to N, and remove N   We find the largest item L in N's right subtree, copy the contents of L to N, and remove L

Using the numbers provided in the following list in the order given, create a binary search tree and show the number that is the parent of number 31: 21, 22, 19, 7, 32, 33, 31, 23, 41, 17, 43, 13, 12, 36, 49

Question 15 Use the Binary Search Tree (BST) deletion algorithm to delete 0074 from the BST below. List the nodes of the resulting tree in pre-order traversal order separated by one blank character. For example, the tree below can be described in the above format as: 65 33 25 47 52 50 88 74 80 77 91 0065 0033 0088 0025 0047 0074 0091 0052 0080 0050 0077