using System;

​

public class Node

{

    public int value;

    public Node right;

    public Node left; 

    public Node find(int v) {

    Node current = this;

    while (current != null) {

        if (current.value == v) {

            return current;

        }

        // This will drop out of the loop naturally if there's no appropriate subnode

        current = v > current.value ? current.left : current.right;

    }

    return null;

}

    public static void Main()

    {

        Node small = new Node();

        small.value = 8;

        small.left = new Node();small.left.value = 2;

        small.right = new Node();small.right.value = 15;

        Node left = small.find(15);

        //Node right = small.find(2);

        Console.WriteLine("Hello World"+left==null?0:left.value);

        //Console.WriteLine("Hello World"+right==null?0:right.value);

    }

}