Write the running time in Big-Oh notation for each of the following algorithms

a) Delete, binary search tree (worst-case). b) Insert, binary search tree (average case). c) Search, complete binary search tree (worse case) d) delete, binary tree (worse case) e) traversal, binary search tree (worse case)