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 vote111 views2 answers
Wpf yes no message box exit
C#
0 vote107 views1 answer
How to use open hardware monitor in c#
C#
1 vote110 views1 answer
Check if network is available c#
C#
10 votes120 views1 answer
How do i make multiplayer in unity
C#
3 votes139 views1 answer
Unity look at target
C#Unity
2 votes103 views1 answer
Linq query select top 1 c#
C#
4 votes105 views3 answers
Sum of digit of number c#
C#
0 vote102 views1 answer
C# get property using string
C#
17 votes126 views3 answers
Unity get list of children
C#
1 vote121 views2 answers
Append 2 arrays c#
C#