(a) What is the Big-O (worst-case) time complexity of a Binary Search Tree? (b) Draw a normal (not self-balancing) Binary Search Tree as if you added the nodes 2, 1, 3, 5, 4 in that order. (c) Re-draw...

Answer all questions Posted this question 5th time if u answered wrong and incomplete this time will give u downvote and -ve rating

Extracted text: (a) What is the Big-O (worst-case) time complexity of a Binary Search Tree? (b) Draw a normal (not self-balancing) Binary Search Tree as if you added the nodes 2, 1, 3, 5, 4 in that order. (c) Re-draw this tree to be balanced. (d) What is the pre-order traversal of your balanced tree? (e) What is the level-order traversal of your balanced tree?