pyassistant

Binary Tree Construction from Level Order Traversal

You are given a list of integers representing the level order traversal of a binary tree. Write a function to return the root node of the binary tree constructed from the list.

Example:

Input:

[3, 9, 20, null, null, 15, 7]

Output:

Node object representing the root of the binary tree

Make sure you return your solution, don't print!

Bot

Trying to solve my challenge? Ask if you must, or press the purple button so I can analyze your code.