C++

1. Given the following B-Tree, of order 5, show how each of the following nodes would be added to the tree. Assume that the changes are cumulative: 49 HKL Add Y to the tree. Add 'D" to the tree. Remove N a. Draw a binary search tree which supports the following set of letters which arrive in the specified order 2. KDRACXLNZ the difference between a B-Tree and a Binary Search Tree. Which is a better choice for an index and why