Question: please exlain 8. What is the run-time of the pushBack () function of an array-based stack vs. a linked list based stack? a. O(n) vs.
please exlain
8. What is the run-time of the pushBack () function of an array-based stack vs. a linked list based stack? a. O(n) vs. O(n) b. O(1) vs. O(n) c. O(n) vs. O(1) 9. What happens if an exception is thrown and is not caught in the current function? a. The program exits b. The function throws an exception up the call stack c. The function continues executing without the result d. The code "fails gracefully" 10. What is the syntax of the block to handle an out_of_range exception? a. try (out of range &oor) b. catch (out of range &oor) c. handle (out of range &oor) d. except (out of range &oor) 11. What is needed to have an O (log n) search operation on a BST? a. Complete binary tree b. A binary tree c. A low balance factor d. Fewer nodes
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
