using System;

public class Program

{

    public static void Main()

    {

        BinaryTree binaryTree = new BinaryTree();

        binaryTree.Insert(25);

        binaryTree.Insert(20);

        binaryTree.Insert(36);

        binaryTree.Insert(10);

        binaryTree.Insert(22);

        binaryTree.Insert(5);

        binaryTree.Insert(12);

        binaryTree.Insert(30);

        binaryTree.Insert(40);

        binaryTree.Insert(28);

        binaryTree.Insert(40);

        binaryTree.Insert(38);

        binaryTree.Insert(48);

​

        Node node = binaryTree.Find(5);

        int depth = binaryTree.GetTreeDepth();

        Console.WriteLine("Tree Depth:");

        Console.Write(depth);

​

        Console.ReadLine();

    }

}

​

class Node

{

    public Node LeftNode { get; set; }

    public Node RightNode { get; set; }

    public int Data { get; set; }

}

​

class BinaryTree

{

    public Node Root { get; set; }

    public bool Insert(int value)

    {

        Node before = null, after = this.Root;

        while (after != null)

        {

            before = after;

            if (value < after.Data)

                after = after.LeftNode; 

            else if (value > after.Data)

                after = after.RightNode;

            else

            {

                return false;

            }

        }

        Node newNode = new Node();

        newNode.Data = value;

        if (this.Root == null)

            this.Root = newNode;

        else

        {

            if (value < before.Data)

                before.LeftNode = newNode;

            else

                before.RightNode = newNode;

        }

        return true;

    }

    public Node Find(int value)

    {

        return this.Find(value, this.Root);            

    }

    private Node Find(int value, Node parent)

    {

        if (parent == null)

        {

            return null;

        }

        if (parent.Data == value)

        {

            return parent;

        }

        var leftNode = parent.LeftNode;

        var rightNode = parent.RightNode;

        var v1 = Find(value, leftNode);

        if (v1 != null)

        {

            return v1;

        }

        var v2 = Find(value, rightNode);

        if (v2 != null)

        {

            return v2;

        }

        return null;

    }

    public int CountLeafNodes()

    {

        return this.CountLeafNodes(this.Root, 0);

    }

    private int CountLeafNodes(Node parent, int counter)

    {

        if (parent == null)

        {

            return 0;

        }

        if (parent.LeftNode == null && parent.RightNode == null)

        {

            return counter + 1;

        }

        var leftNode = parent.LeftNode;

        var rightNode = parent.RightNode;

        int c1 = CountLeafNodes(leftNode, counter);

        int c2 = CountLeafNodes(rightNode, counter);

        return c1 + c2;

    }

    public int GetTreeDepth()

    {

        return this.GetTreeDepth(this.Root);

    }

    private int GetTreeDepth(Node parent)

    {

        return parent == null ? 0 : Math.Max(GetTreeDepth(parent.LeftNode), GetTreeDepth(parent.RightNode)) + 1;

    }

}