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

1 vote298 views1 answer
How to make a specific scene load only on game start in unity
C#Unity
0 vote183 views1 answer
Vb.net console log
C#
1 vote187 views1 answer
Group by ef core
C#
1 vote174 views1 answer
Remove end character of string c#
C#
7 votes179 views2 answers
Check last character of a string c#
C#
2 votes172 views1 answer
C# actions
C#
4 votes180 views1 answer
Find index of combobox index c#
C#
0 vote170 views1 answer
Instantiate iqueryable C#
C#
1 vote184 views1 answer
C# word randomizer
C#
1 vote241 views1 answer
Unity particle system playing at the wrong location
C#Unity