Kallol Bairagikallolbairagi.hashnode.dev·Oct 8, 2023#543.Diameter of Binary Tree [LeetCode Grind 75 in Java]class Solution { private int diameter = 0; //diameter is longest length between any two nodes public int longestLen(TreeNode node){ if(node == null) return 0; //longest length on the left subtree and right subtree ...LeetCode Grind 75 in JavaDSAAdd a thoughtful commentNo comments yetBe the first to start the conversation.