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 vote225 views1 answer
Sliding window algorithm in c#
C#
0 vote223 views2 answers
ExecuteResultAsync ActionContext statuscode
C#
0 vote241 views2 answers
AudioSource unity
C#Unity
0 vote253 views1 answer
How to get user browser information in .net core
C#
1 vote233 views3 answers
Remove comma from string c#
C#
-1 vote232 views1 answer
Unity destroy gameobject with delay
C#
0 vote224 views1 answer
Unity inspector draw line
C#
0 vote251 views2 answers
Unity gravity
C#Unity
0 vote228 views1 answer
Add header in action asp.net mvc
C#
2 votes225 views1 answer
Yield keyword
C#