Skip to content

Instantly share code, notes, and snippets.

View ranacseruet's full-sized avatar

Rana Md Ali Ahsan ranacseruet

View GitHub Profile
@ranacseruet
ranacseruet / gist:7379890
Created November 9, 2013 00:35
Binary Tree Traversal In LISP(Preorder,Inorder & PostOrder)
(defparameter *tree2* '(40 (30 (25 () ()) (35 () ())) (60 (50 () ()) ())))
(defparameter *tree* '(3 (2 (1 () ()) ()) (5 () ())))
;validate if given parameter is a binary tree or not
(defun is-tree(tree)
(cond
((null tree) NIL)
((< (list-length tree) 3) NIL)
(t)
)