Question :

Write a lisp program to check whether the two binary trees have the same structure. The structure of a binary tree is represented through list as (root left right). For two trees to have same structure the values dont need to be the same. A sample tree structure can be displayed as (23 (9 (5)) (18 9 (45 14 27)))

what I have until know is the following :

( defun myf(t1 t2 ) ( cond ( (xor (null t1) (t2)) nil ) ( (xor (atom t1) (atom t2)) nil) ( t (and (myf (car(cdr t1)) (car(cdr t2))) ( myf ( car(cdr(cdr t1))) ( car(cdr(cdr t2)))))) ) )

Write a lisp program to check whether the two binary trees have the same structure. The structure of a binary tree is represented through list as (root left right). For two trees to have same structure the values don't need to be the same. A sample tree structure can be displayed as (23 (9 (5)) (18 9 (45 14 27))) 23 9 18 9 45 5 14 27