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

2 votes343 views1 answer
Play a sound c#
C#
0 vote348 views1 answer
C# e-mail send
C#
0 vote410 views1 answer
Difference between Math.Floor() and Math.Truncate()
C#
1 vote320 views14 answers
}
C#
9 votes344 views2 answers
How to change textMesh Pro unity
C#
0 vote381 views1 answer
Unity using tmpro not working
C#Unity
0 vote380 views1 answer
How to get the date of the first day and last day of the week c#
C#
0 vote374 views1 answer
How to instantiate more enemies in unity
C#Unity
0 vote366 views1 answer
Good food
C#
0 vote334 views1 answer
How can datetimepicker accept hour as well
C#