in java I.Binary SearchTrees (BSTS)(а)Draw the BST where the data value at each node is an integer and the values are entered inthe following order: 36, 22, 10, 44, 42, 60, 50, 70, 80, 85, 75, 55, 45(b)Now draw the trees after deletions of each node 42, 70, 60 and 36 in this order(c)Write down the order on which the node values are reached when the BST of part (c) istraversed(ii) Postorder(iii) Preorder(i)What is the height of the tree of part (a)?Draw the BST on the following data 40, 30, 50, 20, 35, 45, 60, 25, 33, 42, 65. Now drawits mirror imageInorderiv) Level order(d)(e)38BSTMirror of BST(f)Display the tree constructed in (e) using Breadth First Search or level order traversal. i.e.the BFS of above tree is given asа. 5 3714 8(g)Given the In-Order {10 20 25 30 40 45 60} and Pre-Order {40 20 10 30 25 60 45}. Drawthe original BST. Search yourself.(h)Given the In-Order {10 20 25 30 40 45 60} and Post-Order {10 25 30 20 45 60 40}. Drawthe original BST. Search yourself.0000

Name: in java I.Binary SearchTrees (BSTS)(а)Draw the BST where the data valu
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: in java I.Binary SearchTrees (BSTS)(а)Draw the BST where the data value at each node is an integer and the values are entered inthe following order: 36, 22, 10, 44, 42, 60, 50, 70, 80, 85, 75, 55, 45(b)Now draw the trees after deletions of each node