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 vote151 views1 answer
Swagger skip endpoint .net core
C#
0 vote157 views3 answers
Ddsfsd
C#
0 vote154 views1 answer
How to make pc bsod C#
C#
0 vote155 views1 answer
C# show existing form
C#
1 vote198 views1 answer
C# string to memorystream
C#
0 vote165 views1 answer
Linq find object from id
C#
13 votes167 views3 answers
C# list get last element
C#
0 vote150 views1 answer
Change text size unity
C#
0 vote220 views1 answer
VLC .net
C#
0 vote179 views1 answer
.net core Enable-Migrations' is not recognized as the name of a cmdlet
C#