Hey I found some great code online on geeksforgeeks but I am having trouble understanding it, Could you provide better code comments for it. This code is used to find the distance between two nodes on a binary tree. /* Java Program to find distance between n1 and n2 using one traversal */public class GFG { public static class Node { int value; Node left; Node right; public Node(int value) { this.value = value; } } public static Node LCA(Node root, int n1, int n2) { if (root == null) return root; if (root.value == n1 || root.value == n2) return root; Node left = LCA(root.left, n1, n2); Node right = LCA(root.right, n1, n2); if (left != null && right != null) return root; if (left == null && right == null) return null; if (left != null) return LCA(root.left, n1, n2); else return LCA(root.right, n1, n2); } // Returns level of key k if it is present in // tree, otherwise returns -1 public static int findLevel(Node root, int a, int level) { if (root == null) return -1; if (root.value == a) return level; int left = findLevel(root.left, a, level + 1); if (left == -1) return findLevel(root.right, a, level + 1); return left; } public static int findDistance(Node root, int a, int b) { Node lca = LCA(root, a, b); int d1 = findLevel(lca, a, 0); int d2 = findLevel(lca, b, 0); return d1 + d2; } // Driver program to test above functions public static void main(String[] args) { // Let us create binary tree given in // the above example Node root = new Node(1); root.left = new Node(2); root.right = new Node(3); root.left.left = new Node(4); root.left.right = new Node(5); root.right.left = new Node(6); root.right.right = new Node(7); root.right.left.right = new Node(8); System.out.println("Dist(4, 5) = " + findDistance(root, 4, 5)); System.out.println("Dist(4, 6) = " + findDistance(root, 4, 6)); System.out.println("Dist(3, 4) = " + findDistance(root, 3, 4)); System.out.println("Dist(2, 4) = " + findDistance(root, 2, 4)); System.out.println("Dist(8, 5) = " + findDistance(root, 8, 5)); }}

Question

Hey I found some great code online on geeksforgeeks but I am having trouble understanding it, Could you provide better code comments for it. This code is used to find the distance between two nodes on a binary tree.  /* Java Program to find distance between n1 and n2   using one traversal */public class GFG {     public static class Node {        int value;        Node left;        Node right;         public Node(int value) { this.value = value; }    }     public static Node LCA(Node root, int n1, int n2)    {        if (root == null)            return root;        if (root.value == n1 || root.value == n2)            return root;         Node left = LCA(root.left, n1, n2);        Node right = LCA(root.right, n1, n2);         if (left != null && right != null)            return root;        if (left == null && right == null)            return null;        if (left != null)            return LCA(root.left, n1, n2);        else            return LCA(root.right, n1, n2);    }     // Returns level of key k if it is present in    // tree, otherwise returns -1    public static int findLevel(Node root, int a, int level)    {        if (root == null)            return -1;        if (root.value == a)            return level;        int left = findLevel(root.left, a, level + 1);        if (left == -1)            return findLevel(root.right, a, level + 1);        return left;    }     public static int findDistance(Node root, int a, int b)    {        Node lca = LCA(root, a, b);         int d1 = findLevel(lca, a, 0);        int d2 = findLevel(lca, b, 0);         return d1 + d2;    }     // Driver program to test above functions    public static void main(String[] args)    {         // Let us create binary tree given in        // the above example        Node root = new Node(1);        root.left = new Node(2);        root.right = new Node(3);        root.left.left = new Node(4);        root.left.right = new Node(5);        root.right.left = new Node(6);        root.right.right = new Node(7);        root.right.left.right = new Node(8);        System.out.println(&#34;Dist(4, 5) = &#34;                           + findDistance(root, 4, 5));         System.out.println(&#34;Dist(4, 6) = &#34;                           + findDistance(root, 4, 6));         System.out.println(&#34;Dist(3, 4) = &#34;                           + findDistance(root, 3, 4));         System.out.println(&#34;Dist(2, 4) = &#34;                           + findDistance(root, 2, 4));         System.out.println(&#34;Dist(8, 5) = &#34;                           + findDistance(root, 8, 5));    }}

Accepted Answer

Here I am providing a simple code so that you can understand the program.
The program is implemented…