Solve mixed coding tasks from interviews

Four independent tasks are described below. For each one, implement the requested function and handle the stated edge cases. Task 1: Binary Tree Leaves A binary tree is supplied in level-order serialization as a list. Each entry is either an integer node value or None; a None entry means that the corresponding left or right child is absent. When the list is empty, or when the first entry is None, treat the tree as empty. Return the values of all leaf nodes in left-to-right…