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 vote210 views1 answer
Add css class based on model value razor
C#
0 vote140 views2 answers
C# download image from url
C#
1 vote199 views1 answer
C# max two values
C#
1 vote169 views1 answer
Socket would block error c#
C#
0 vote182 views1 answer
C# enum variable set to nonthing
C#
1 vote191 views1 answer
Unity change tag of go
C#
0 vote150 views1 answer
C# use cefcharp and selenium can?
C#
3 votes208 views2 answers
Unity Make a 2D object look at the mouse position
C#
1 vote205 views2 answers
Merge xml files into one c#
C#
30 votes288 views3 answers
Unity list
C#Unity