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 vote126 views1 answer
.net core copy directory to output
C#
3 votes124 views1 answer
Read folder c#
C#
1 vote163 views1 answer
Unity custom update
C#Unity
0 vote155 views1 answer
Unity make particles stay still
C#Unity
0 vote119 views2 answers
Übersetzer
C#
-1 vote132 views1 answer
C# reverse a string for loop
C#
0 vote132 views1 answer
Dynamics 365 create record c#
C#
1 vote127 views2 answers
C# datagridview column size
C#
-1 vote130 views3 answers
Google tradutor
C#
1 vote114 views1 answer
C# among us modding tutorial
C#