It is from c++

Question 4.10 and 4.11

Chapter 4 Trees 4.10 LetfoN) be the average number of full nodes in an N-node binary search tree. a. Determine the values of f(0) and f(l). b. Show that for N > 1 N-1 N-21 c. Show (by induction) that f(N) (N - 2)/3 is a solution to the equation in part (b), with the initial conditions in part (a). d. Use the results of Exercise 4.6 to determine the average number of leaves in an 4.11 Write an implementation of the set class, with associated iterators using a binary 4.12 Write an implementation of the map class by storing a data member of type 4.13 Write an implementation of the set class, with associated iterators using a binary N-node binary search tree. search tree. Add to each node a link to the parent node. set>. search tree. Add to each node a link to the next smallest and next largest node To make your code simpler, add a header and tail node which are not part of the binary search tree. but heln make the linred list ort tsa