You don&#x27;t <i>need</i> to know BFS, you need to show that you can come up with a BFS implementation if you need to do so. You can always say &quot;wait, remind me again, which one was BFS?&quot; and the interviewer can certainly tell you at least what the conditions are. Maybe he might think a bit less of you (although I personally wouldn&#x27;t) because BFS is a really really common name in the jargon of a programmer, but still it&#x27;s better than simply blanking out and then angrily claiming that it&#x27;s unfair to ask BFS.<p>A similar question could be &quot;Can you print in order all the elements of a given tree&#x2F;graph?&quot;, would you find that more fair compared to straight out using the word &quot;BFS&#x2F;Breadth First Search&quot;?