title: Deleting a node in a circular linked list c++?
body: <p>EDITED:
  using c++ to code.</p>
  
  <pre><code>void circularList::deleteNode(int x)
  {
      node *current;
      node *temp;
      current = this-&gt;start;
  
      while(current-&gt;next != this-&gt;start)
      {
          if(current-&gt;next-&gt;value == x)
          {
              temp = current-&gt;next;
              current-&gt;next = current-&gt;next-&gt;next;
              delete current-&gt;next;
          }
      else{ 
              current = current-&gt;next;
               }
      }
  }
  </code></pre>
  
  <p>Added the else i'm sorry i kinda forgot to copy that part of the code and yes it is for learning purposes. I'm new to coding with c++ and probably come off as a noob sorry about that. </p>
  
  <p>Also as for  this line of code</p>
  
  <p>this->start->value == x</p>
  
  <p>im not sure what you mean by it or where you think it goes, yes there are nodes in the linked list and assume that it will always have at lease 1 node all the time.</p>