Skip to content
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

Leetcode 2458. Height of Binary Tree After Subtree Removal Queries #148

Open
Woodyiiiiiii opened this issue Oct 30, 2022 · 0 comments
Open

Leetcode 2458. Height of Binary Tree After Subtree Removal Queries #148

Woodyiiiiiii opened this issue Oct 30, 2022 · 0 comments

Comments

@Woodyiiiiiii
Copy link
Owner

  1. 后序遍历标记每个节点的深度(从后至上)
  2. 先序遍历
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@Woodyiiiiiii