yeah that would be helpful
Can you please explain me this section of code actually i am quite dull in recursion
how did you updated count of nodes from child nodes.
root->cnt = root->cnt - cnt;
if(root->cnt > 1)
{
lli n = (root->cnt / 2);
lli tmp = (height / 2) * (height / 2);
ans += n * tmp;
cnt += 2 * n;
}
delete root;
return cnt;
For this there would be a recursive call to dfs( ) function again.
if you are not good at recursion , try studying it from basics , like finding N! using recursion and Fibonacci number.
bro, plz add java code in description or any platform. so, i can compare the error and if not getting the logic we can ccheck the code too.
for that i need who can volunteer to write java codes , because i work with c++.
Though i would see if i can write some of the codes in Java
@waqar_ahmad224 You putting all your time and efforts to create such content is really appreciable!! Great Work
Thanks man.
11 Feb 2020 : new practice problem video added…
L10.1 : Monk and the islands (HackerEarth) | Breadth First Search
bro upload next parts
yeah , I am working on it
Bro can you also make content on network flow algorithms?
concepts like Centroid decomposition and flow graph i will be covering in part 2 , so yes i will be making lectures on those
Any plan to make more videos on combinatorics?
Btw your graph series was very helpful.