Check valid binary search tree java

public bool IsBinaryTree(Node node, int min = int.MinValue, int max = int.MaxValue)
{
    if (root == null)
    	return true;
    if (node.data < min || node.data > max)
    	return false;
        
    return  IsBinaryTree(node.leftChild,min,node.data-1) &&
    		IsBinaryTree(node.rightChild,node.data+1,max);
}

// node Structure
    public class Node
    {
        public int data;
        public Node leftChild;
        public Node rightChild;
        public Node(int data)
        {
            this.data = data;
        }
    }

Similar codes

-1 vote170 views1 answer
Unity get layermask
C#
10 votes176 views4 answers
C# list shuffle
C#
0 vote181 views1 answer
C# linq mselect
C#
0 vote218 views1 answer
Unity get default font
C#Unity
-1 vote237 views1 answer
Unity destroy gameobject with delay
C#Unity
1 vote300 views3 answers
How to deal with ERESOLVE unable to resolve dependency tree
C#
0 vote228 views4 answers
Badlion
C#
0 vote183 views1 answer
C# picturebox cursor hand
C#
0 vote133 views1 answer
Startup c# class winform
C#
0 vote220 views1 answer
Unity apply bloom of a different color
C#Unity