Course: Data Structures and Algorithms

Course Code: CS-443

Question:

Consider a binary search Tree:

1. Delete Root Node and re-draw tree (no need to write code)
2. Represent new tree into array (no need to write code)
3. Implement given tree using Linked (Write complete code for insertion and deletion)

Provide solution of all three parts

92 80 95 85 102 70 60 86