Look at the B tree of order 5 given below and insert 12, 56, 9, and 14 into it. Do this on scratch paper. no coding necessary

Given the following data, draw the following trees: 40 20 25 60 65 70 73 15 - AVL tree -2-3 tree - BST tree Неар - 2-3-4 tree red-black tree -

For the AVL Tree what values could you insert to cause a right-left imbalance and at which node does the imbalance occur? Please show and explain based on the tree provided.

please explain You are given a collection of 1,000,000,000 books that are already sorted. They are labeled Book1, Book2, Book3, Book4 (book 1 is less than book 2, book 3 less than book 4, etc.). Your colleague says organizing these books in a binary search tree (BST) data structure will be useful for looking up books later. Your colleague begins inserting each book in order, but you are worried you will not get Log(N) lookup when inserting books in already sorted order. What will the lookup time be of a book when searching for a book?  Group of answer choices a. O(log(n) b. O(n) c. O(n*log(n)) d. O(n*n)