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

Solve Problem 2471. Minimum Number of Operations to Sort a Binary Tree by Level #2297

Open
threeal opened this issue Dec 23, 2024 · 0 comments · May be fixed by #2298
Open

Solve Problem 2471. Minimum Number of Operations to Sort a Binary Tree by Level #2297

threeal opened this issue Dec 23, 2024 · 0 comments · May be fixed by #2298
Assignees
@threeal
Labels
feat test
Milestone
December 2024

Comments

@threeal
Copy link
Owner

threeal commented Dec 23, 2024

This issue proposes solving the problem 2471. Minimum Number of Operations to Sort a Binary Tree by Level. To achieve this, we can use BFS to explore nodes at the same level, sort them, and compare the actual elements with the sorted elements to determine how many swaps are needed to sort the given binary tree by level.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@threeal threeal

Labels
feat test
Projects
None yet
Milestone
December 2024
Development

Successfully merging a pull request may close this issue.

Solve Problem 2471. Minimum Number of Operations to Sort a Binary Tree by Level threeal/leetspace
1 participant
@threeal