Count Good Nodes in Binary Tree: Leetcode 75 in Tamil (தமிழ்)

[@HeroHunter07]

Nice explanation 🎉

[@Graduate-Hands]

Thank you for Sharing Very Valuable Contents .. Keep Going 😊

[@indiccoder]

Thank you 😁

[@prabhup2241]

Thank you bro for the video! There are only few creators who give leetcode content in Tamil. Nandigal🙏🏻

[@indiccoder]

Thank you bro! I'm glad it was helpful 😊

[@SANJAI692]

bro please put all the 75 questions bro romba helpfula irukum bro.

[@indiccoder]

Yes bro, have resumed the playlist again.

[@indiccoder]

Java Solution: class Solution { public int goodNodes(TreeNode root) { return count(root,Integer.MIN_VALUE); } public int count(TreeNode node, int maxValue) { if(node==null) { return 0; } int isGood = 0; if (node.val>=maxValue) { isGood = 1; maxValue = node.val; } return isGood + count(node.left,maxValue) + count(node.right,maxValue); } }