COMP 348 ASS2 Q4, Common Lisp

Language: Layout:

(defun isValid (tree)
    (let ((root (car tree)))
    (let ((leftChildNode (car (car (cdr tree)))))
    (let ((rightChildNode (car (car (cdr (cdr tree))))))
    (let ((leftChild (car (cdr tree))))
    (let ((rightChild (car (cdr (cdr tree)))))
         
         
         
         
         
         ; Case 1: 1 left & 1 right child 
         (if (and (not (eq leftChild () )) (not (eq rightChild () )))
             (if (and (or (> root leftChildNode) (= root leftChildNode)) (< root rightChildNode))
                 (progn
                     (isValid leftChild)
                     (isValid rightChild))
                 (print "This is not a valid binary tree")
        ))
         
         
         ; Case 2: 1 left, 0 right (and (not (= leftChild () )) (= rightChild () ) ) 
        
           (if  (and (not (eq leftChild () ))  (eq rightChild () ))
                (if (or (> root leftChildNode) (= root leftChildNode)) 
                (isValid leftChild)
                (print "This is not a valid binary tree")
        ))

; Case 3: 0 left, 1 right (and (= leftChild () )) (not (= rightChild () ) ))
         (if (and (eq leftChild () ) (not (eq rightChild () )))
         (if (< root rightChildNode)         
             (isValid rightChild)
             (print "This is not a valid binary tree") 
        ))
         
         ;Case 4: 0 left, 0 right 
         (if (and (eq leftChild () ) (eq rightChild () ))
         (print "This is a valid binary tree"))))))))
        
    
(isValid '(8 (3 (1 () ()) (6 (49 () ())(7 () ()))) (10 () (14 (173 () () ) ()))))

[ + ] Show input
Absolute running time: 0.2 sec, cpu time: 0.03 sec, memory peak: 6 Mb, absolute service time: 0,33 sec