Given the root of a binary tree, return the level order traversal of its nodes' values.
Minimum number of turns required to open a lock.
Given a binary tree, print its reverse level order traversal