C# (CSharp) BinarySearchTreeV5の例

コード例 #1

 public void insert(double value)
 {
     if (value <= this.Data)
     {
         if (LeftNode == null)
         {
             BinarySearchTreeV5 node = new BinarySearchTreeV5(value);
             this.LeftNode = node;
         }
         else
         {
             LeftNode.insert(value);
         }
         ++TrackNum;
     }
     else
     {
         if (RightNode == null)
         {
             BinarySearchTreeV5 node = new BinarySearchTreeV5(value);
             this.RightNode = node;
         }
         else
         {
             RightNode.insert(value);
         }
     }
 }

コード例 #2

ファイル: CCN9_8.cs プロジェクト: Sanqiang/Algorithm-Win

 public void insert(double value)
 {
     if (value <= this.Data)
     {
         if (LeftNode==null)
         {
             BinarySearchTreeV5 node = new BinarySearchTreeV5(value);
             this.LeftNode = node;
         }
         else
         {
             LeftNode.insert(value);
         }
         ++TrackNum;
     }
     else
     {
         if (RightNode == null)
         {
             BinarySearchTreeV5 node = new BinarySearchTreeV5(value);
             this.RightNode = node;
         }
         else
         {
             RightNode.insert(value);
         }
     }
 }