Breadth-First Search on Tree | Dataford Interview Questions

Write an algorithm to perform a breadth-first search (BFS) traversal on a binary tree.

Represent each node as a dictionary with val, left, and right keys, where missing children are null. Implement def bfs(root): and return a list of node values visited level by level. Return an empty list when root is null.

Constraints

The input is a binary tree represented by nested dictionaries.
Each node contains integer val, left, and right fields.
Each child is either another node dictionary or null.
0 <= number of nodes <= 1000

Function Signature

def bfs(root):

Your question is Breadth-First Search on Tree. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Write an algorithm to perform a breadth-first search (BFS) traversal on a binary tree.

Constraints

The input is a binary tree represented by nested dictionaries.
Each node contains integer val, left, and right fields.
Each child is either another node dictionary or null.
0 <= number of nodes <= 1000

Function Signature

def bfs(root):

Your question is Breadth-First Search on Tree. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.