title: Recursion in Merge Sort, Quick Sort and traversal of trees
body: <p>While learning different algorithms (like <em>merge sort</em>, <em>quick sort</em> or <em>Tree traversals</em>) I have observed that there are two recursive calls immediately followed by each other.</p>
  <p>I am unable to understand completely. Please explain in simple terms why do we use two recursive calls? Is this any kind of pattern?</p>
  <p>Also are there any algorithms where more than two immediate recursive calls are made?</p>
  <p><strong>Merge Sort</strong></p>
  <p>m_sort(numbers, temp, left, mid);<br />
  m_sort(numbers, temp, mid+1, right);</p>
  <p><strong>Tree Traversals</strong></p>
  <p>preorder(node.left)<br />
  preorder(node.right)</p>