Partition a Binary Tree
Difference between en1 and en2, changed 0 character(s)
Given a `binary tree`, ↵
↵
We have to `remove a single edge` and partition the tree into `two new trees` such that `difference of their diameters remains less than a given constant k`. ↵
↵
Please suggest me an approach of O(n) time complexity.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English go_rob 2017-04-07 17:08:32 0 (published)
en1 English go_rob 2017-04-07 17:08:17 266 Initial revision (saved to drafts)