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 vote117 views1 answer
Jq map over array
C#
-1 vote128 views1 answer
C# fileinfo filename without extension
C#
47 votes125 views5 answers
Remove last character from stringbuilder c#
C#
7 votes118 views1 answer
How to change image color unity
C#
0 vote113 views2 answers
Class merging
C#
1 vote110 views1 answer
Ef core set identity_insert off
C#
0 vote116 views1 answer
How to pass id to modal in asp.net mvc
C#
0 vote111 views1 answer
Show snackbar without scaffold flutter
C#
0 vote111 views1 answer
Decimal operator in Convert.toDouble() C#
C#
2 votes128 views1 answer
How to reset rotation in unity
C#Unity