Algorithm · Meta · Medium
This exercise contains two independent coding tasks. The first requires processing a binary tree stored in level-order form; the second asks you to search an integer array for zero-sum triples while avoiding duplicates. Task 1: Right-Side View of a Level-Order Binary Tree A binary tree is given as a Python list in level-order. The entry None indicates that the corresponding child position is empty. Determine which node values are visible when the tree is viewed from its…
Checking your access…