Maximum Depth of Binary Tree Leetcode 104. Learn BFS and DFS in 2 minutes with complete Code

[@probabilitycodingisfunis1]

BFS: queueq; if(root==NULL)return 0; q.push(root); int ans = 0; while(!q.empty()) { int n = q.size(); ans++; for(int i=0;ileft)q.push(node->left); if(node->right)q.push(node->right); } } return ans; DFS: if(!root)return 0; return max(maxDepth(root->left), maxDepth(root->right))+1;

[@venkatakalyan4953]

Great Explanation

[@vibhavsharma2724]

Thanks for this best explanation 👍

[@Idukhan-jj9kc]

❤❤❤

[@AltafHussain-eq6ot]

Great content🔥

[@probabilitycodingisfunis1]

Thank you altaf

[@greatred2558]

Nice

[@harshmishra061]

Mam please make video on DELETE AND EARN QUES IN LEETCODE(DYNAMIC PROGRAMMING).

[@dhananjoydey1337]

Niceeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeee

[@muhammadyaseen8683]

plz tell me what we are adding in answer

[@mrinalmadhav8119]

I love u alisha

[@hydrocy.9165]

int maxDepth(TreeNode* root) { int maxDepth = 0; // Initialize the maximum depth int count = 0; // Initialize the current depth counter dfs(root, count, maxDepth); return maxDepth; } private: void dfs(TreeNode* node, int count, int &maxDepth) { if (node == NULL) return; count++; // Increment counter to reflect current depth if (count > maxDepth) { maxDepth = count; // Update maximum depth } dfs(node->left, count, maxDepth); dfs(node->right, count, maxDepth); } }; this code works but i cant understand how every recursion call maintain its own count variable