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

2 votes369 views2 answers
How to convert a 2d coordinate to an index
C#
2 votes364 views2 answers
Ksi
C#
1 vote339 views1 answer
What type of variable is true or false in c#
C#
0 vote348 views1 answer
Web.config customerrors not working
C#
16 votes348 views9 answers
Hello world c#
C#
0 vote360 views1 answer
Jagged array to 2d array c#
C#
2 votes353 views1 answer
Unity deactive code from code
C#
1 vote336 views1 answer
.net: setting max size for sql parameter
C#
13 votes354 views2 answers
Unity convert float to decimal
C#Unity
0 vote354 views1 answer
T SQL Format GetDate()
C#