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 vote124 views1 answer
Unity matchinfo
C#
5 votes161 views1 answer
F#
C#
0 vote140 views1 answer
IEqualityComparer gethashcode strings c#
C#
1 vote123 views1 answer
Fon der lajen
C#
3 votes208 views1 answer
Character Controller unity isGrounded is false
C#Unity
0 vote133 views1 answer
.net core change localhost port
C#
0 vote123 views1 answer
How to get the width of the screen C#
C#
0 vote130 views1 answer
String length f#
C#
-2 votes121 views2 answers
C# concatenation
C#
0 vote138 views1 answer
Summernote dropdown plugin
C#