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

27 votes169 views4 answers
How to get a length of a string in c#
C#
0 vote165 views1 answer
Unity android plugin callback
C#
2 votes242 views1 answer
Unity default rotation
C#Unity
0 vote156 views1 answer
Tuple parameter name
C#
0 vote177 views1 answer
C# easy
C#
0 vote172 views1 answer
C# get witdh of matrix
C#
0 vote170 views1 answer
C# split large file into chunks
C#
0 vote167 views1 answer
Unity agent look at
C#
2 votes156 views1 answer
Unity overlapsphere
C#Unity
1 vote181 views1 answer
Unity c# struct
C#