Kallol Bairagikallolbairagi.hashnode.dev·Oct 8, 2023#104.Maximum Depth of Binary Tree [LeetCode Grind 75 in Java]class Solution { public int maxDepth(TreeNode root) { if(root == null) return 0; //BFS traversal Queue<TreeNode> q = new LinkedList<TreeNode>(); q.add(root); int depth = 0; while(!q.isEmpty()){ ...LeetCode Grind 75 in JavaDSAAdd a thoughtful commentNo comments yetBe the first to start the conversation.