title: Does recursive loop not proceed to the next item if it fails?
body: <p>So I have this homework almost done, but only after I figure out why the heck
  this loop does not continue when I call it recursively.</p>
  
  <p>I will take a name as an input and return his children and father as an output.</p>
  
  <p>e.g., Kanky's children are satan,malan,ulan,yugi<br>
  and satan's children are ben &amp; Alan<br>
  malan has no child, my tree looks something like this:</p>
  
  <pre><code>T=["Kanky",["satan",["ben","ian"],"Alan"],"malan",["yugi","yuppi"]]
  </code></pre>
  
  <p>My code:</p>
  
  <pre><code>def find_the_man(T,name):
  
      F = tree[0]     # the head of list
      C = tree[1:]    # tail of the list
      kids = ""       # find the kids and append to this str
      if F==name:
          i = 0
          while i&lt;len(C):
            #do some things to find the children
            #return them
  
  
      for i in C:      ### this loop tries to find the man with no child
          if i==name:
              return [daddy,notfound] ### if it finds, returns it
  
      for i in C:             ### this is my whole thing, it takes just the
          if type(i)==list:   ### first list(unfortenately), if it finds the 
              find_the_man(i,name)  ### man by doing the actions on top,
          else:continue             ### it returns the child, but it is not able to
                                ### proceed the next lists, so when i give an input
  return [notfound,notfound]    ### like (T,"yugi"), it gives notfound :(
  </code></pre>