We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
The statement of this problem has some defects !!, the output can be >= 0, and the statement says that it is only > 0, in addition to that it is understood that it is to divide the tree into 3, and then add the node, however in fact, you can split it in 2, and create a new tree....
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Balanced Forest
You are viewing a single comment's thread. Return to all comments →
The statement of this problem has some defects !!, the output can be >= 0, and the statement says that it is only > 0, in addition to that it is understood that it is to divide the tree into 3, and then add the node, however in fact, you can split it in 2, and create a new tree....