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 vote338 views1 answer
String in int c#
C#
5 votes307 views2 answers
C# stop loop
C#
0 vote325 views1 answer
Orderby make sunday last day c#
C#
9 votes336 views2 answers
How to change textMesh Pro unity
C#
0 vote319 views1 answer
Export2excel with logo and header and many table on one click stackoverflow
C#
3 votes339 views3 answers
Rigidbody2d unity
C#
0 vote315 views1 answer
Discord bot c# how to refresh message
C#
15 votes386 views2 answers
How to play animation with code in unity
C#
5 votes323 views1 answer
Get set c#
C#
0 vote332 views1 answer
Unity callback
C#