The question asked in the video was, find the smallest height of a node that can be visited from subtree of x.
I didn’t get the question and what’s dp[3] mean in this problem and why dp[3]=0 in this graph below:
The question asked in the video was, find the smallest height of a node that can be visited from subtree of x.
I didn’t get the question and what’s dp[3] mean in this problem and why dp[3]=0 in this graph below:
Hello @Kinjal here it is 0 because dp[3] means what is the minimum level of a node you can reach from the subtree of 3. So here in the subtree of 3 there exists 5 which can lead us to 1, the least possible node level.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.