Welcome to Day 43 of the DSA Coding Challenge:

Todays Goals(Binary Trees):

Question 1:Level Order traversal

Write a function that takes the root of a binary tree, and returns the level order traversal of its nodes' values. (i.e., from left to right, level by level). Initially write an instance method for the Binary Search tree class to insert the values given as an array into the Binary tree (from left to right, level by level). Each value in the array which is not null is to be made a node and added to the tree. (See examples below). Then write the function mentioned first.

Question 2:Left/Right View of binary tree

1. Given the root of a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.

2. Given the root of a binary tree, imagine yourself standing on the left side of it, return the values of the nodes you can see ordered from top to bottom.

All the best!