leetcode【199】【tag Tree】Binary Tree Right Side View【c++版本,层次遍历,DFS两种方法】
问题描述:Givenabinarytree,imagineyourselfstandingontherightsideofit,returnthevaluesofthenodesyoucanseeorderedfromtoptobottom.Example:Input: [1,2,3,null,5,null,4]Output: [1,3,4]Explanation:1rightSideView(T