title: reverse nodes of a tree scheme
body: <p>Defines the reverse-tree method that receives a tree as a parameter and returns 
  invested all its branches:</p>
  
  <p>I do this:</p>
  
  <pre><code>(define (reverse-tree t)
    (map (lambda (x)
           (if (list? x)
               (deep-reverse x)
               x))
         (reverse t)))
  
  
   (define tree '(40 (28 (9) (32)) (70 (52) (102))))
  
  
  (reverse-tree tree)
  </code></pre>
  
  <p>I returned this:</p>
  
  <pre><code>(((102) (52) 70) ((32) (9) 28) 40)
  </code></pre>
  
  <p>But I need you to return the reversed nodes:</p>
  
  <pre><code>(40 (70 (102) (52)) (28 (32) (9)))
  </code></pre>
  
  <p>How do I return to the reversed nods</p>