C# (CSharp) Pipes BinaryTreeElement.HasNext Examples

Example #1

 public void Traverse(BinaryTreeElement element)
 {
     if (element.HasNext())
     {
         Traverse(element.Left);
         Traverse(element.Right);
     }
     else
     {
         this.MatchCollection.Add(element);
         return;
     }
 }

Example #2

 public void Separate(BinaryTreeElement element)
 {
     if (element.HasNext())
     {
         Separate(element.Left);
         Separate(element.Right);
     }
     else
     {
         this.MatchCollection.Add(element);
         return;
     }
 }