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 vote169 views1 answer
Linq c#
C#
4 votes159 views1 answer
Unity check when clicked on object
C#Unity
1 vote133 views1 answer
Access a local varible in a different function C#
C#
0 vote132 views1 answer
Iis services in asp.net
C#
-3 votes129 views1 answer
How to split a string by in c#
C#
1 vote189 views1 answer
Unity how to get the side ways velocity of a object
C#Unity
1 vote131 views1 answer
Linq c# where condition
C#
3 votes122 views2 answers
C# instantiation
C#
0 vote141 views1 answer
Styles does not exisit in current context
C#
0 vote131 views1 answer
C# properties making string required
C#