if root is none in the first case, then it will return 1 and will go again for the recursive call again check for if root.left is none then again it will return 1+ countNodes(root.left ) so in this way by the it will reach 4 it will reuturn 3 . kindly give the explanation how it is returning for the function call
Great solution you saved my assignment 😭
wow, bro! well Explained
Amazing Explanation
Sir what an intro "Red Coder"!!! Wow...
Thanks😂😂
Really good tutorial!
Easily Explained wow!!
Very helpful brother
Nice explanation......
if root is none in the first case, then it will return 1 and will go again for the recursive call again check for if root.left is none then again it will return 1+ countNodes(root.left ) so in this way by the it will reach 4 it will reuturn 3 . kindly give the explanation how it is returning for the function call