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.

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

Tree Algo #6

Open
2 of 11 tasks
souvikmahato-sm opened this issue Nov 19, 2020 · 3 comments
Open
2 of 11 tasks

Tree Algo #6

souvikmahato-sm opened this issue Nov 19, 2020 · 3 comments
Assignees
Labels
documentation Improvements or additions to documentation

Comments

@souvikmahato-sm
Copy link

souvikmahato-sm commented Nov 19, 2020

Topic: Graph

Subtopic: Tree Algorithms

  • Tree traversal
  • DP to count subtrees of each node
  • Finding diameter of tree
  • Finding Center and Centroid
  • Finding LCA (Binary Lifing)
  • Spanning trees
  • Topological sort

Small Description: Diameter of a tree is the maximum length between two nodes.

Checks:

  • explanation
  • implementation
  • references
  • extra problems for practice
@souvikmahato-sm
Copy link
Author

Please assign this to me !

@arnabsen1729
Copy link
Member

Add some more topics under Trees, like Binary Lifting LCA and others.

@iammanish17
Copy link

Assign subtree dp and traversal to me please.

@arnabsen1729 arnabsen1729 added the good first issue Good for newcomers label Nov 19, 2020
@arnabsen1729 arnabsen1729 changed the title Diameter of a tree Tree Algo Nov 22, 2020
@arnabsen1729 arnabsen1729 added documentation Improvements or additions to documentation and removed good first issue Good for newcomers labels Nov 28, 2020
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
documentation Improvements or additions to documentation
Projects
None yet
Development

No branches or pull requests

3 participants