Space complexity of BFS approach for problem 14.1 is O(n) or O(w)?

[gan3i]

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 w is the width of tree is more precise than O(n), please correct me if my understanding is wrong.