Question

Define a function called symcount that takes a symbol and a list and returns the number of times the symbol occurs in the list. If the list contains sublists, all occurrences should be counted no matter how deeply they are nested.

(define syscount(lambda (n x)
  (if (empty? x)
    0
  (if (equal? n (car x))
    (+ 1 syscount(n (cdr x))))))) 

this is what i have written help me pls

Answer 1

(define (syscount n x) 
            (if (null? x) 0 
                  (if (list? (car x))  (+ (syscount n (car x)) (syscount n (cdr x))) 
                         (+ (syscount n (cdr x)) (if (equal? n (car x)) 1 0))))) 

Output is

(syscount ‘1 ‘(1 2 3))
1

(syscount ‘1 ‘(1 (1 2) 3))
2
(syscount ‘1 ‘(1 (1 2) 1 (1) 3))
4