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 vote191 views1 answer
Change object position
C#
1 vote188 views1 answer
GGdesign
C#
0 vote168 views1 answer
How to cut image from timeline editor in c#
C#
35 votes109 views10 answers
C# initialize array
C#
5 votes165 views4 answers
C# adding two arrays together
C#
1 vote123 views1 answer
Change partial view based on select asp.net core
C#
-2 votes193 views1 answer
Unity c# flip sprite
C#Unity
31 votes219 views3 answers
Unity reload current scene
C#Unity
0 vote168 views1 answer
Unity Rigidbody how to set zero momentum
C#
0 vote169 views1 answer
Validate base64 string c#
C#