【LeetCode】199. Binary Tree Right Side View

Problem:Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom. 题目:给定一个二叉树,输出从右侧看到的节点(大致就是每层的最右侧的节点). 思路:做的二叉树的深度
相关文章
相关标签/搜索