Generic BST

Kode 

using System;

namespace BinarySearchTreeExample
{
    public class Node<T> where T : IComparable<T>
    {
        public Node<T> Right { get; set; }
        public Node<T> Left { get; set; }
        public T Value { get; set; }

        public Node(T value)
        {
            Value = value;
        }
    }
}

Kode 

using System;

namespace BinarySearchTreeExample
{
    class Vare : IComparable<Vare>
    {
        public string Navn { get; set; }
        public decimal Pris { get; set; }

        public int CompareTo(Vare other)
        {
            return Pris.CompareTo(other.Pris);
        }
    }
}

CSharp kode 

 class TreeNode<Type>
     {
         private Type data;
         
         private TreeNode<Type> left;
         private TreeNode<Type> right;
 
         public TreeNode(Type data)
         {
             this.data = data;
             this.left = this.right = null;
         }
 
         public void Insert(Type value)
         {
             if (value < data)
             {
                 if (left == null)
                     left = new TreeNode<Type>(value);
                 else
                     left.Insert(value);
             }
 
         }
 
         public Type Data
         {
             get
             {
                 return this.data;
             }
             set
             {
                 this.data = value;
             }
         }
 
         public TreeNode<Type> LeftNode
         {
             get
             {
                 return this.left;
             }
             set
             {
                 this.left = value;
             }
         }
 
         public TreeNode<Type> RightNode
         {
             get
             {
                 return this.right;
             }
             set
             {
                 this.right = value;
             }
         }
     }

CSharp kode 

 namespace BST
 {
     class TreeNode
     {
         private IComparable data;
 
         private TreeNode left;
         private TreeNode right;
 
         public TreeNode(IComparable data)
         {
             this.data = data;
             this.left = this.right = null;
         }
 
         public void Insert(IComparable value)
         {
             if (value.CompareTo(data) == -1)
             {
                 if (left == null)
                     left = new TreeNode(value);
                 else
                     left.Insert(value);
             }
 
         }
 
         public IComparable Data
         {
             get
             {
                 return this.data;
             }
             set
             {
                 this.data = value;
             }
         }
 
         public TreeNode LeftNode
         {
             get
             {
                 return this.left;
             }
             set
             {
                 this.left = value;
             }
         }
 
         public TreeNode RightNode
         {
             get
             {
                 return this.right;
             }
             set
             {
                 this.right = value;
             }
         }
     }
 }