Explain why a balanced search tree is better than a generic BST. Keep your discussion rigorous, comparing the efficiency of balanced and unbalanced trees in terms of asymptotic efficiency classes. Be sure to include the best and worst search efficiency. Is there a way to quantify performance as it relates to exactly how balanced or unbalanced the tree becomes? In other words, if I tell you a tree is unbalanced by a certain amount, can you tell me exactly what the search performance will be? Explain using drawings or diagrams.

Please help! If possible, please include explanation so I understand why the answer is what it is.

Question 4. Show the result of inserting 2, 1, 4, 5, 9, 3, 6, 7 into an initially empty AVL tree.

PLEASE ANSWER ALL QUESTIONS AND SHOW AND EXPLAIN STEPS THANK YOU. PLEASE I NEED THIS ASAP.

Consider a B-tree with a node size of 8, a 50% fill rate, and a total number of records to be added of 12000. Calculate B-height. Tree's

I need to construct a optimal binary search tree (OBST).  I am using Python to create this code. I already started creating the binary search tree. I need help trying to implement the optimal binary search tree. I did the class and then I did the insertion next to add the nodes. There needs to be at least 20 nodes. After that, I'm stuck. Not sure what code is needed to add for optimal cost.  Criteria from my assignment: Contains at minimum 20 nodes.  All paths must have a cost between 1-15. You must use each cost at least once with the remaining costs of your choice in the same range. All nodes must be able to communicate with all other nodes (does not have to be a direct path) Each node can only connect to, at maximum, 5 other nodes. The cost of an extra hop is 1 1/2 times the cost of the second path and 2 times the cost of a third path.  Any path greater than 3 is at the same cost as the third. This is what is required for us in the assignment.  My Code in Python: class BST:def…

Mark Zuckerberg, the CEO of Facebook, has hired you to lead the Facebook Algorithms Group. He has asked you to use various graph algorithms to analyze the world's largest social network. The Facebook Graph has 2.8 billion vertices, with each vertex being a Facebook user. Two vertices are connected provided those two users are "friends". The first decision you need to make is how you want to model the Facebook graph. Determine whether you should use an adjacency-list representation or an adjacency-matrix representation.

Answer the given question with a proper explanation and step-by-step solution. Question 1 What is the worst time complexity for inserting an arbitrary item into a AVL tree? 0(n) 0 (log2 (n)) 0(1) 0(n^2) 0 (n log2 (n))   Question 2 What is the worst time complexity for inserting an arbitrary item into a binary search tree? 0(n) 0 (log2(n)) 0(1) 0 (n^2) 0 (n log2 (n))   Question 13 What is the time complexity for efficiently ordering elements (sorting) from a binary search tree? 0 (n) 0 (Log2 (n)) 0(1) 0(n^2) 0 (n log2 (n))   Question 11 The average Big O runtime to find an arbitrary element in an arbitrary AVL tree is roughly equal to the element in which other data structure or structures? Queue Hash Table Sorted Array LinkedList None of the above   Question 13 What is the time complexity for efficiently ordering elements (sorting) from a binary search tree? 0 (n) 0 (log2 (n)) 0(1) 0 (n^2) 0 (n log2 (n))   Question 23 What is the time complexity of the most time efficient algorithm for…

What is the time complexity for these operation in average case (balanced tree), respectively? What is the time complexity for these operation in average case (balanced tree), respectively?  In a BST with n nodes, what is the time complexity for searching, insertion, and deletion in worst case? What is the height of node 3, and node 9, respectively? What is the depth of node 3, and node 9, respectively? What is the level of node 17, and node 11, respectively?  Insert integers 11, 22, 15, 44, 6, 9, 3, 33, 17, 5 into a BST in that order. Draw the final tree.

Build the d table for the following graph if you use the breadth first search and start from node s. Remember that we use the alphabetical order rule Assume the blanks/boxes are for the following nodes. Each blank/box is for one node. starting from node r followed by s, t, u, v, w, x, and y, respectively. S t и V W y