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 vote362 views1 answer
Instantiate a player in photon
C#
0 vote294 views1 answer
Csharp declare constan
C#
0 vote276 views1 answer
Asp.net core update-database specify environment
C#
0 vote288 views1 answer
Start wpf application when windows start
C#
0 vote299 views1 answer
Get parent name unity for inspector
C#
8 votes307 views2 answers
C# textbox numbers only
C#
0 vote279 views1 answer
Flyt wordpress fra localserver
C#
0 vote318 views1 answer
Encode pdf file to base64 c#
C#
0 vote333 views1 answer
Monogame print
C#
2 votes314 views1 answer
Unity can't invoke method
C#Unity