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

Create Finding a Centroid.cpp #372

Open

4d4r5h wants to merge 1 commit into arnab2001:main from 4d4r5h:4d4r5h-patch-2

4d4r5h commented Oct 10, 2022 •

edited

Loading

Given a tree of n nodes, our task is to find a centroid, i.e., a node such that when it is appointed the root of the tree, each subtree has at most ⌊n/2⌋ nodes.

Finding a Centroid (CSES)


          Create Finding a Centroid.cpp

2697a45

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

Labels

None yet