### Topic: Graph ### Subtopic: Tree Algorithms - [ ] Tree traversal - [ ] DP to count subtrees of each node - [x] Finding diameter of tree - [ ] Finding Center and Centroid - [x] 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
Topic: Graph
Subtopic: Tree Algorithms
Small Description: Diameter of a tree is the maximum length between two nodes.
Checks: