Check valid binary search tree c#

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 vote147 views1 answer
Beard styles without mustache Intitle:work with me
C#
0 vote128 views1 answer
Computing a Cartesian product or Combinations with LINQ
C#
2 votes129 views1 answer
C# get object property value by name
C#
0 vote126 views2 answers
C# api get value from header
C#
0 vote133 views1 answer
C# switch case greater than
C#
0 vote173 views1 answer
Epplus how to align text to right
C#
2 votes125 views1 answer
Compute months c#
C#
0 vote171 views1 answer
Unity how to destroy child
C#Unity
0 vote164 views1 answer
How to get total scenes unity
C#Unity
0 vote166 views1 answer
Update squence c#
C#