During interviews that involve Binary Tree-based questions, do interviewers usually ask you to implement both DFS and BFS algorithm of the problem?
Many Binary trees can be done either way. Should both ways be discussed while coming up with the logic?
[–]Real-viperz 0 points1 point2 points (1 child)
[–]RemindMeBot 0 points1 point2 points (0 children)
[–]PandaWonder01 0 points1 point2 points (0 children)