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 vote100 views1 answer
C# list remove duplicate items
C#
0 vote97 views1 answer
Checking if a list contains a value unity
C#
0 vote99 views1 answer
Where in used in linq c#
C#
0 vote98 views1 answer
Unity string lowercase
C#
0 vote113 views1 answer
Unity 2d swap out background image
C#Unity
20 votes96 views1 answer
C# initialize dictionary
C#
1 vote102 views1 answer
Unity get perlin noise 3d
C#
0 vote104 views2 answers
String parameter too long.' c#
C#
0 vote83 views1 answer
Small index c#
C#
5 votes89 views1 answer
C# display float with 2 decimal places
C#