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

10 votes174 views1 answer
Get value after decimal point
C#
0 vote230 views1 answer
Unity inspector draw line
C#Unity
1 vote209 views1 answer
Hos to make slider in editor unity
C#
0 vote202 views1 answer
Sucess messages in c#
C#
3 votes230 views1 answer
What does update() do unity
C#Unity
3 votes213 views2 answers
C# add 2 arrays
C#
0 vote211 views1 answer
C# MD5.Create returning nul
C#
0 vote196 views1 answer
C# handle dbnull value
C#
0 vote198 views1 answer
Provide inject vue
C#
0 vote278 views1 answer
How to store some variables on the device in unity
C#Unity