New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

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

Open

tkkclym opened this issue Feb 15, 2025 · 0 comments

tkkclym commented Feb 15, 2025

这里不用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

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment