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

5 votes261 views4 answers
C# linq foreach example
C#
2 votes270 views1 answer
How to download something from onedrive unity
C#Unity
0 vote282 views1 answer
Regex ip rage detect c#
C#
0 vote232 views1 answer
String trin c#
C#
0 vote257 views1 answer
Private Vector3 direction;
C#
33 votes271 views2 answers
How to parse a string to an integer c#
C#
0 vote465 views2 answers
How to subtract two rows asp ne gridview in asp.net
C#
7 votes271 views3 answers
Add two numbers in c#
C#
1 vote319 views1 answer
Unity agent bake not derecting mesh
C#
2 votes271 views1 answer
C# write byte[] to stream
C#