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 vote294 views1 answer
Could not load file or assembly 'Ubiety.Dns.Core, Version=2.2.1.0
C#
0 vote267 views1 answer
Close windows by esc wpf
C#
0 vote282 views1 answer
C# move object to position
C#
0 vote305 views1 answer
Monogame print
C#
0 vote268 views1 answer
.net Core Return File like File Server
C#
1 vote295 views1 answer
Entity framework update child records
C#
0 vote287 views3 answers
Student roll mvc
C#
0 vote294 views1 answer
How to execute a script after the c# function executed
C#
0 vote269 views3 answers
C#: casting string to enum object
C#
7 votes290 views1 answer
How to convert int to string unity c#
C#Unity