Treaps in C#

///<summary>
/// The TreapNode class encapsulates a node in the treap
///</summary>

using System;
using System.Text;

namespace TreapCS
{
	public class TreapNode
	{
		// key provided by the calling class
		private IComparable ordKey;
		// the data or value associated with the key
		private object objData;
		// random priority to balance the tree
		private int intPriority;
		// left node of the tree
		private TreapNode tnLeft;
		// right node of the tree
		private TreapNode tnRight;
		
		///<summary>
		///Key
		///</summary>
		public IComparable Key
		{
			get
            {
				return ordKey;
			}
			
			set
			{
				ordKey = value;
			}
		}
		///<summary>
		///Data
		///</summary>
		public object Data
		{
			get
            {
				return objData;
			}
			
			set
			{
				objData = value;
			}
		}
		///<summary>
		///Priority
		///</summary>
		public int Priority
		{
			get
            {
				return intPriority;
			}
			
			set
			{
				intPriority = value;
			}
		}
		///<summary>
		///Left
		///</summary>
		public TreapNode Left
		{
			get
            {
				return tnLeft;
			}
			
			set
			{
				tnLeft = value;
			}
		}
		///<summary>
		/// Right
		///</summary>
		public TreapNode Right
		{
			get
            {
				return tnRight;
			}
			
			set
			{
				tnRight = value;
			}
		}
		///<summary>
		/// RotateLeft
		/// Rebalance the tree by rotating the nodes to the left
		///</summary>
		public TreapNode RotateLeft()
		{
			
			TreapNode temp  = Right;
			Right           = Right.Left;
			temp.Left       = this;
			
			return temp;
		}
		///<summary>
		/// RotateRight
		/// Rebalance the tree by rotating the nodes to the right
		///</summary>
		public TreapNode RotateRight()
		{
			TreapNode temp  = Left;
			Left            = Left.Right;
			temp.Right      = this;
			
			return temp;
		}
		///<summary>
		/// DeleteRoot
		/// If one of the children is an empty subtree, remove the root and put the other
		/// child in its place. If both children are nonempty, rotate the treapTree at
		/// the root so that the child with the smallest priority number comes to the
		/// top, then delete the root from the other subtee.
		///
		/// NOTE: This method is recursive
		///</summary>
		public TreapNode DeleteRoot()
		{
			TreapNode temp;
			
			if(Left == null)
				return Right;
			
			if(Right == null)
				return Left;
			
            if(Left.Priority < Right.Priority)
            {
                temp        = RotateRight();
                temp.Right  = DeleteRoot();
            }
            else
            {
                temp        = RotateLeft();
                temp.Left   = DeleteRoot();
            }

			return temp;
		}
	}
}