#424 Binary Tree with Depth-First and Breadth-First Traversal

Companies:

Sberbank

Themes:

AlgorithmsTreesPractice

Implement a binary tree with the following operations: insertion, non-recursive depth-first traversal, and non-recursive breadth-first traversal.

Question review

Mentor

Answer as you would in a real interview. I’ll ask follow-up questions, then compare your answer with the reference answer and show your accuracy as a %.

Sign in to start the dialogue The mentor keeps the context of the current question and your previous messages.