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

0 vote174 views1 answer
Unity vector3 initialization
C#
0 vote147 views1 answer
IdentityServer vs JWT vs OAuth?
C#
7 votes143 views2 answers
How to clone somthing unity
C#
0 vote129 views1 answer
Two lowest positive numbers given an array of minimum
C#
0 vote142 views1 answer
Unity dontdestroyonload
C#
0 vote281 views1 answer
How to import forgerock sdk in c#
C#
27 votes161 views3 answers
Basic movement script unity
C#Unity
0 vote133 views1 answer
How to change the volume of all sound effects in monogame
C#
0 vote130 views1 answer
Access form in a folder C#
C#
0 vote131 views2 answers
.net return context.Result without extra new objectResult
C#