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 vote223 views1 answer
Filedialog get folder path c#
C#
4 votes231 views1 answer
Unity rotation between 2 points
C#Unity
101 votes590 views6 answers
Convert string to int c#
C#
0 vote239 views1 answer
Qcombobox delegate text filter
C#
0 vote248 views1 answer
List of function in c#
C#
120 votes534 views6 answers
C# random int
C#
0 vote202 views1 answer
Linq query get last day of month
C#
1 vote172 views1 answer
Photon rpc
C#
0 vote202 views1 answer
Asp.net core mvc not triggering client side validation
C#
0 vote221 views1 answer
C# sprint key
C#