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 vote297 views1 answer
Linq dynamic order by descending
C#
3 votes312 views1 answer
Get type of variable c#
C#
6 votes375 views2 answers
Unity check collider layer
C#Unity
0 vote336 views1 answer
How to set the forgound color of listitems in c#
C#
6 votes417 views1 answer
Unity rotate vector
C#Unity
0 vote322 views1 answer
Settings save c# visual studio doesn't work
C#
31 votes302 views3 answers
C# adding to a list
C#
0 vote308 views1 answer
C# webapi return file
C#
0 vote315 views2 answers
Streamwriter c#
C#
0 vote382 views1 answer
C# oracle transaction commit example
C#