title: Reviewing an append function for a linked list
body: <p>This is a practice problem that I'm sure is correct, but after reviewing similar examples on the site, I feel the need to double check.</p>
  
  <p>Consider this declaration of the nodes in a linked list of integers:</p>
  
  <pre><code>class LinkedListNode {
       int x;
       LinkedListNode next;
  }
  </code></pre>
  
  <p>Make a <em>recursive method</em> append that satisfies this claim: If H is the head of the linked list of integers and t is an integer, then add(H, T) is linked list of integers which comes from adding T to the end the list with H as its head.</p>
  
  <pre><code>private Node append(Node H, int t){
      if (H == null) {
          H = new Node(x);
      }
      else {
          H.next = append(H.next, t);
      }
      return H;
  }
  </code></pre>
  
  <p>I have reviewed other questions here, but I still have some doubts that I'm right. Any help would be greatly appreciated.</p>