Optimal Tree Splitting and Greedy Algorithms
Published in
5 min readJul 12, 2021
This post will tackle a problem of optimally splitting a tree (or removing edges from it), and will discuss how Greedy algorithms result in simple solution to the problem. The whole solution fits within about 40 lines of code.
Feel free to read a few older posts to read more on Greedy Algorithms.
