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 vote137 views1 answer
Raq query ef core
C#
1 vote158 views3 answers
C# remove duplicates from list
C#
1 vote147 views1 answer
Get item from icollection
C#
6 votes135 views1 answer
Unity access child
C#
0 vote143 views1 answer
How to stop a form c#
C#
1 vote156 views1 answer
Cshtml foreach
C#
0 vote168 views1 answer
Unity 2D how to make top-down look controller
C#Unity
5 votes142 views5 answers
Decimal c# 2 digits
C#
0 vote176 views1 answer
Update squence c#
C#
0 vote144 views1 answer
C# response.contenttype set filename
C#