Practice Problems: 1. From the given list of integers prepare a min-heap A [10, 3, 7, 9, 23, 1] 2. Let the following structure is used to create a binary search tree struct tree node int data; int degree, int height, struct tree node *left: struct tree node *right, class bst struct tree node root public: bst(), bst(int); void insert(int); void insert (int, struct tree node write pseudocode to implement the functions in bst class