Tree-Algorithms

My solution to all the CSES Tree Algorithms Problems.

Subordinates : Dynamic Programming to calculate subtree size rooted at each node.
Tree Matching : Dynamic Programming on Trees.
Tree Diameter : 1st solution based on Proof of Diameter. 2nd using Dynamic Programming on Trees where we try all possible paths.
Tree Distances I : Dynamic Programming on Trees + Rerooting Technique.
Tree Distances II : Dynamic Programming on Trees + Rerooting Technique.
Company Queries I : Binary Lifting(which in itself is a Dynamic Programing Approach).
Company Queries II : Answer LCA queries in O(logn) Time Using Binary Lifting . (Note: Binary Search + Binary Lifting Will give TLE because it will be O(log²n) per query ).
Distance Queries : Binary Lifting.

Name		Name	Last commit message	Last commit date
Latest commit History 14 Commits
README.md		README.md
Tree matching.cpp		Tree matching.cpp
company queries 1 iterative.cpp		company queries 1 iterative.cpp
company queries 1.cpp		company queries 1.cpp
company queries2.cpp		company queries2.cpp
distance queries.cpp		distance queries.cpp
subordinates.cpp		subordinates.cpp
template.cpp		template.cpp
tree diameter.cpp		tree diameter.cpp
tree distance 1.cpp		tree distance 1.cpp
tree distance2.cpp		tree distance2.cpp

Provide feedback