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 vote179 views1 answer
C# display a variable to a text gameobject
C#
0 vote197 views1 answer
Paging thru result from mongodb in C#
C#
12 votes198 views10 answers
Google
C#
-1 vote210 views1 answer
How to fix unity crashing
C#Unity
4 votes201 views1 answer
Unity round float to nearest 10
C#Unity
1 vote172 views1 answer
Linq query select where c#
C#
0 vote202 views1 answer
Unity get refresh rate
C#
0 vote203 views1 answer
Store Images In SQL Server Using EF Core And ASP.NET Core
C#
0 vote190 views1 answer
C# font bold set
C#
0 vote185 views1 answer
Get controller name from ActionExecutingContext .net 4.x
C#