Ganesha Nageshappa

search_student fucntion on page 147 returns wrong result.

2

import collections from typing import Tuple, List , Callable import bisect Student = collections.namedtuple("Student",('gpa','name')) def comp_gpa(student : Student ) -> Tuple[float, str]: return (-student.gpa, student.name) def search_student(students : List[Student], target...

The BFS approach of is_binary_tree_bst function stores nodes in a queue but queue will never hold all the nodes at any point, so stating the space complexity as O(w) where...