Answer Happy

Question 11 1 pts Which data object would best fit an algorithm to evaluate algebraic expressions such as "3 +4* 5", taking operator precedence into consideration? O Queue Two queues Two stacks A stack and a queue

Question 13 1 pts Which data object would best fit a backtracking algorithm to navigate a maze? Singly linked list O Queue O Circular array Stack

Question 14 1 pts Consider the implementation of the list class in your textbook. What is wrong with the implementation of the previous function shown here? class Iterator { public: Iterator; void previous(); private: Node position; List* container; friend class List; }; void Iterator::previous() { position = position->previous; } The previous function should return the data value of the node to which the iterator points. If position is nullptr, this will result in an attempt to dereference a nullptr pointer. It is not legal for the Iterator object to refer to the previous field in a Node object. There is no problem with the implementation of the previous function.