Question  - Binary Tree on fire:\nA binary tree catches a fire on all the leaf nodes. A node takes 1 second for it to burn and fall off the tree and it only falls of if it doesn\'t have any nodes under it. We want to take a snapshot of the tree every second for future analysis.\nFind the leaves that fell of at each second.\n\n**Input:** root = [1,2,3,4,5]\n**Output:** [[4,5,3],[2],[1]] / [[5,4,3],[2],[1]]\n1      1           \n        /\\              \n       2  3        \n       /\\\n       4 5\n       \n\n [4 5 3] , [2] , [1]\n\t\t \nI gave approach ,like for each row , I will do binary search. find the index of first one and set max row and count of 1.\n\nTopological sort is best approach.

Question  - Binary Tree on fire:\nA binary tree catches a fire on all the leaf nodes. A node takes 1 second for it to burn and fall off the tree and it only fal