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 vote261 views2 answers
2d look at unity
C#
0 vote303 views2 answers
Mydata api .net
C#
0 vote264 views1 answer
Celsius to Fahrenheit c#
C#
59 votes340 views3 answers
C# date format
C#
1 vote276 views1 answer
GGD
C#
0 vote257 views1 answer
How to make panel scrollable c#
C#
13 votes302 views2 answers
How to acivate a game object unity
C#Unity
0 vote254 views1 answer
User control equivalent event for form.shown c#
C#
0 vote279 views1 answer
C# solution path
C#
23 votes291 views3 answers
Unity textmeshpro
C#Unity