Update Solution.java

src/main/java/g1301_1400/s1373_maximum_sum_bst_in_binary_tree/Solution.java

@@ -7,28 +7,28 @@
 
 public class Solution {
  public int maxSumBST(TreeNode root) {
- isBst temp = checkBST(root);
+ isbst temp = checkBST(root);
 
  return Math.max(temp.maxSum, 0);
  }
 
- private static class isBst {
+ private static class isbst {
  int max = Integer.MIN_VALUE;
  int min = Integer.MAX_VALUE;
  boolean isBST = true;
  int sum = 0;
  int maxSum = Integer.MIN_VALUE;
  }
 
- private isBst checkBST(TreeNode root) {
+ private isbst checkBST(TreeNode root) {
  if (root == null) {
- return new isBst();
+ return new isbst();
  }
 
- isBst lp = checkBST(root.left);
- isBst rp = checkBST(root.right);
+ isbst lp = checkBST(root.left);
+ isbst rp = checkBST(root.right);
 
- isBst mp = new isBst();
+ isbst mp = new isbst();
  mp.max = Math.max(root.val, Math.max(lp.max, rp.max));
  mp.min = Math.min(root.val, Math.min(lp.min, rp.min));
  mp.sum = lp.sum + rp.sum + root.val;