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 vote314 views1 answer
Dart extending list
C#
0 vote345 views1 answer
Set custom default file in startup
C#
0 vote339 views1 answer
C# ipaddress to integer
C#
0 vote341 views1 answer
Overridable method C#
C#
1 vote332 views1 answer
How to delete multiple file by datagridview in c#
C#
1 vote317 views1 answer
What is namespace in c#
C#
0 vote340 views1 answer
Static initializer
C#
2 votes325 views1 answer
C# empty IEnumerable
C#
2 votes302 views1 answer
How to change the position of a gameobject in c# unity
C#
0 vote296 views1 answer
How to move object with keyboard in unity 3D
C#