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 vote256 views1 answer
C# don't scroll up after onclick
C#
1 vote246 views2 answers
Append 2 arrays c#
C#
0 vote232 views3 answers
Student roll mvc
C#
0 vote218 views1 answer
C# get process file location
C#
0 vote207 views1 answer
Check if list contains any empty element in c#
C#
0 vote206 views1 answer
Asp.net textarea disable resize
C#
1 vote233 views1 answer
West of loathing
C#
0 vote222 views1 answer
Accord.io read .mat file
C#
0 vote250 views3 answers
Change physics material unity
C#Unity
0 vote236 views1 answer
C# soundplayer playlooping
C#