Skip to content

关于翻转二叉树章节使用广度优先遍历方法 #2895

Open
@tkkclym

Description

@tkkclym

这里不用size就行,返回值类型是TreeNode*,又不是为了返回数组,使用size的话感觉多此一举了,而且还多套了层循环,https://programmercarl.com/0226.%E7%BF%BB%E8%BD%AC%E4%BA%8C%E5%8F%89%E6%A0%91.html#%E5%B9%BF%E5%BA%A6%E4%BC%98%E5%85%88%E9%81%8D%E5%8E%86

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions