title: How to add elements in Binary search tree iteratively?
body: <pre><code>   public void Insert(int value)
      {
          if (value &lt; Data)
          {
              if (LeftNode == null)
              {
                  LeftNode = new TreeNode(value);
              }
              else
              {
                  LeftNode.Insert(value);
              }
          }
          else if (value &gt; Data)
          {
              if (RightNode == null)
              {
                  RightNode = new TreeNode(value);
              }
              else
              {
                  RightNode.Insert(value);
              }
          }
      }
  </code></pre>
  
  <p>I wrote method to add element in BST recursively, It checks for value to add less than or greater than and add it in its proper place, but I want to know how iterative method works? I need iterative add method for my BST. </p>