Answer Happy

Consider the following Binary Search Tree 6 4 10 (2) key 6? a 13 ) a) what what is the successor of the node with Explain the steps followed by the sessor algorithm to return valid result in this specific scenario. b) what is the successor of the node with key 5? Explain the steps S followed by the successer algerithm to return vallo result in this specific Scenario c) What is the asymptotic for the Successor algorithm on with n nodes that is balanced? What is It if the tree not balanced? 1) What is the minimum key in the binary search tree? Explain the general steps to obtain the minimum value in a binary tree. worst case cost a tree is

of a e) what is the main advantage hash table over a binary search tree? when would you want binary search tree over hash table? to Use a