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

9 votes125 views2 answers
C# convert readline to int
C#
0 vote162 views2 answers
Unity timer
C#
4 votes117 views1 answer
Find index of combobox index c#
C#
0 vote134 views1 answer
Button action asp net
C#
1 vote87 views2 answers
For else c#
C#
0 vote129 views1 answer
C# disable docking sub member in panel
C#
0 vote132 views1 answer
What is a model in C#
C#
0 vote127 views1 answer
C# .net core kendo dropdownlistfor enum
C#
-1 vote124 views1 answer
Unity colllion not working
C#
0 vote116 views1 answer
Remove carriage returns from string c#
C#