using System;

public class Program

{

    public static void Main(string[] args) 

{ 

    BinaryTree tree = new BinaryTree(); 

        Node root = null;

        root = tree.insert(root, 4); 

        tree.insert(root, 2); 

        tree.insert(root, 8); 

        tree.insert(root, 3); 

        tree.insert(root, 6); 

        tree.insert(root, 5); 

​

Console.WriteLine(tree.minValue(root)); 

} 

}

// C# program to check if binary tree 

// is full or not 

​

​

/* Tree node structure */

public class Node 

{ 

    public int data; 

    public Node left, right; 

​

    public Node(int item) 

    { 

        data = item; 

        left = right = null; 

    } 

} 

​

class BinaryTree 

{ 

public Node root; 

​

/* This function checks if a binary 

tree is full or not */

public int minValue(Node node) 

{ 

    Node current = node;

    // if empty tree 

    while (current.left!= null) 

    { 

      current = current.left; 

    } 

​

    // if leaf node 

    return current.data;

} 

     public virtual Node insert(Node node, int data) 

    { 

        /* 1. If the tree is empty, return a new,       

         single node */

        if (node == null) 

        { 

            return (new Node(data)); 

        } 

        else

        { 

            /* 2. Otherwise, recur down the tree */

            if (data <= node.data) 

            { 

                node.left = insert(node.left, data); 

            } 

            else

            { 

                node.right = insert(node.right, data); 

            } 

            /* return the (unchanged) node pointer */

            return node; 

        } 

    } 

​

// Driver Code 

​

} 

​

​