Question: 5. Which of the following can be the base case for the recursive implementation used to find the length of linked list?<div class="hk1_style-wrap4"><div class="hk1_style-wrap3"><div class="hk1_style-wrap2"><div class="hk1_style-wrap"><div class="hk1_style"><div class="c"><pre class="de1"><span class="co2">#include&lt;stdio.h&gt;</span> <span class="co2">#include&lt;stdlib.h&gt;</span> <span class="kw4">struct</span> Node <span class="br0">{</span> <span class="kw4">int</span> val<span class="sy0">;</span> <span class="kw4">struct</span> Node <span class="sy0">*</span>next<span class="sy0">;</span> <span class="br0">}</span><span class="sy0">*</span>head<span class="sy0">;</span> <span class="kw4">int</span> get_len<span class="br0">(</span><span class="br0">)</span> <span class="br0">{</span> <span class="kw4">struct</span> Node <span class="sy0">*</span>temp <span class="sy0">=</span> head<span class="sy0">-&gt;</span>next<span class="sy0">;</span> <span class="kw4">int</span> len <span class="sy0">=</span> <span class="nu0">0</span><span class="sy0">;</span> <span class="kw1">while</span><span class="br0">(</span>temp <span class="sy0">!=</span> <span class="nu0">0</span><span class="br0">)</span> <span class="br0">{</span> len<span class="sy0">++;</span> temp <span class="sy0">=</span> temp<span class="sy0">-&gt;</span>next<span class="sy0">;</span> <span class="br0">}</span> <span class="kw1">return</span> len<span class="sy0">;</span> <span class="br0">}</span> <span class="kw4">int</span> main<span class="br0">(</span><span class="br0">)</span> <span class="br0">{</span> <span class="kw4">int</span> arr<span class="br0">[</span><span class="nu0">10</span><span class="br0">]</span> <span class="sy0">=</span> <span class="br0">{</span><span class="nu0">1</span><span class="sy0">,</span><span class="nu0">2</span><span class="sy0">,</span><span class="nu0">3</span><span class="sy0">,</span><span class="nu0">4</span><span class="sy0">,</span><span class="nu0">5</span><span class="br0">}</span><span class="sy0">,</span> n <span class="sy0">=</span> <span class="nu0">5</span><span class="sy0">,</span> i<span class="sy0">;</span> <span class="kw4">struct</span> Node <span class="sy0">*</span>temp<span class="sy0">,</span> <span class="sy0">*</span>newNode<span class="sy0">;</span> head <span class="sy0">=</span> <span class="br0">(</span><span class="kw4">struct</span> Node<span class="sy0">*</span><span class="br0">)</span><span class="kw3">malloc</span><span class="br0">(</span><span class="kw4">sizeof</span><span class="br0">(</span><span class="kw4">struct</span> Node<span class="br0">)</span><span class="br0">)</span><span class="sy0">;</span> head<span class="sy0">-&gt;</span>next <span class="sy0">=</span> <span class="nu0">0</span><span class="sy0">;</span> <span class="kw4">int</span> len <span class="sy0">=</span> get_len<span class="br0">(</span><span class="br0">)</span><span class="sy0">;</span> <span class="kw3">printf</span><span class="br0">(</span><span class="st0">"%d"</span><span class="sy0">,</span>len<span class="br0">)</span><span class="sy0">;</span> <span class="kw1">return</span> <span class="nu0">0</span><span class="sy0">;</span> <span class="br0">}</span></pre></div></div></div></div></div></div>
Options:
if(current_node == 0) return 1
if(current_node->next == 0) return 1
if(current_node->next == 0) return 0
if(current_node == 0) return 0
Answer: D