Tree Data structure in C Sharp .NET

Here is a simple Tree data structure in C sharp.NET

using System;
using System.Collections.Generic;
using System.Text;

namespace Algorithms
{
    class Tree
    {
        private TreeNode root;
        public Tree()
        {
            root = null;
        }

        public TreeNode FindRecursive(TreeNode root, int dataValue)
        {
            if (root == null)
            { return null; }
            else if (root.DataValue == dataValue)
            { return root; }
            else if (root.DataValue < dataValue)
            { return FindRecursive(root.RightNode, dataValue);}
            else 
            { return FindRecursive(root.LeftNode, dataValue); 
            }
        }
        public TreeNode Find(int dataValue)
        {
            if (root == null)
            {
                return null;
            }
            else
            {
                TreeNode currentNode = root;
                while (currentNode != null)
                {
                    if (currentNode.DataValue == dataValue)
                    {
                        return currentNode;
                    }
                    else if (currentNode.DataValue < dataValue)
                    {
                        currentNode = currentNode.RightNode; 
                    }
                    else if (currentNode.DataValue > dataValue)
                    {
                        currentNode = currentNode.LeftNode; 
                    }
                    return null;
                }
                return null;
            }
        }
    }
    public class TreeNode
    {
        private int dataValue;
        private TreeNode leftNode = null;
        private TreeNode rightNode = null;

        public TreeNode(int data)
        {
            dataValue = data;
        }
        public TreeNode LeftNode
        {
            get
            {
                return leftNode;
            }
            set
            {
                leftNode = value;
            }
        }
        public TreeNode RightNode
        {
            get
            {
                return rightNode;
            }
            set
            {
                rightNode = value;
            }
        }
        public int DataValue
        {
            get
            {
                return dataValue;
            }
            set
            {
                dataValue = value;
            }
        }

    }
}