Comp Sci Algorithms help.

Please Read the problem carefully and understand it!! If you handwrite everything, please be legible!! Thank you for your help:) if you have any questions please ask!!

Original Answers only please, any copied answers will be disliked appropriately!

2) Given a singly-linked list with n nodes and head is pointing to the first node of the list. The worst case time to delete a node is: A) O(1) B) O(n) C) O(n log n) D) O(n) 3) Given a complete binary search tree with n nodes and root is pointing to the root of the tree. The time to delete a leaf node is: A) O(1) B) O(log n) C) O(n log n) D) C(n) 4) The height of a full tree with n nodes is: A) n B) 1 + log n C) n/2 D) 2n 5) Given a stack implemented with a dynamic array of size n, the worst case time required to complete a push operation is and the average time required to push n elements is A) O(1) B) O(log n) C) O(n) D) O(n log n)