CMPU-365, Fall 2014 Asmt. 1 Solutions in Lisp -- Interactions CL-USER(9): (load "bintrees-in-") ; Fast loading ; /home/hunsberg/courses/cs365/2014-asmt1/solns-lisp/bintrees-in-.fasl (PRINT-BIN-TREE (MAKE-NODE)) ==> | [-1] | NIL (PRINT-BIN-TREE (MAKE-NODE DATUM 45)) ==> | [45] | NIL (PRINT-BIN-TREE (MAKE-NODE DATUM 48 LEFTY *MT-TREE*)) ==> | [48] | NIL (PRINT-BIN-TREE (MAKE-NODE LEFTY *MT-TREE* DATUM 48)) ==> | [48] | NIL (PRINT-BIN-TREE TREE3) ==> | [23] | [37] | [55] | NIL (PRINT-BIN-TREE BIG-TREE) ==> | [92] | [100] | [77] | [999] | [23] | [37] | [55] | NIL T CL-USER(10): (compile-file "asmt1-solns-in-") ;;; Compiling file asmt1-solns-in-.lisp ;;; Writing fasl file asmt1-solns-in-.fasl ;;; Fasl write complete #P"/home/hunsberg/courses/cs365/2014-asmt1/solns-lisp/asmt1-solns-in-.fasl" NIL NIL CL-USER(11): (load "asmt1-solns-in-") ; Fast loading ; /home/hunsberg/courses/cs365/2014-asmt1/solns-lisp/asmt1-solns-in-.fasl ========================== CMPU-365, Fall 2014 Asmt. 1 Solutions! ========================== The sample bin-trees from 'bintrees.txt'... ; Fast loading ; /home/hunsberg/courses/cs365/2014-asmt1/solns-lisp/bintrees-in-.fasl (PRINT-BIN-TREE (MAKE-NODE)) ==> | [-1] | NIL (PRINT-BIN-TREE (MAKE-NODE DATUM 45)) ==> | [45] | NIL (PRINT-BIN-TREE (MAKE-NODE DATUM 48 LEFTY *MT-TREE*)) ==> | [48] | NIL (PRINT-BIN-TREE (MAKE-NODE LEFTY *MT-TREE* DATUM 48)) ==> | [48] | NIL (PRINT-BIN-TREE TREE3) ==> | [23] | [37] | [55] | NIL (PRINT-BIN-TREE BIG-TREE) ==> | [92] | [100] | [77] | [999] | [23] | [37] | [55] | NIL ============================================ 1: INSERT-NUMS ============================================ (PRINT-BIN-TREE (INSERT-NUMS '(5 2 3 8 9 2 16 4 3 0 12) *MT-TREE*)) ==> | [16] | [12] | [9] | [8] | [5] | [4] | [3] | [2] | [0] | NIL (PRINT-BIN-TREE (INSERT-NUMS '(50 25 75 12 37 62 88 5 17 28 30 42 99 52 85 57 77 72 60) *MT-TREE*)) ==> | [99] | [88] | [85] | [77] | [75] | [72] | [62] | [60] | [57] | [52] | [50] | [42] | [37] | [30] | [28] | [25] | [17] | [12] | [5] | NIL (PRINT-BIN-TREE (CREATE-BIN-TREE '(4 3 8 9 2 4 5 4 6))) ==> | [9] | [8] | [6] | [5] | [4] | [3] | [2] | NIL (PRINT-BIN-TREE (CREATE-BIN-TREE NIL)) ==> | NIL (PRINT-BIN-TREE (CREATE-BIN-TREE '(1 2 3 4))) ==> | [4] | [3] | [2] | [1] | NIL (PRINT-BIN-TREE (CREATE-BIN-TREE '(4 3 2 1))) ==> | [4] | [3] | [2] | [1] | NIL (PRINT-BIN-TREE (CREATE-BIN-TREE '(2 4 1 3))) ==> | [4] | [3] | [2] | [1] | NIL ============================================ 2: DF listing ============================================ (GEN-DEPTH-FIRST-LISTING *MT-TREE*) ==> NIL (GEN-DEPTH-FIRST-LISTING (CREATE-BIN-TREE '(1 2 3 4))) ==> (1 2 3 4) (GEN-DEPTH-FIRST-LISTING (CREATE-BIN-TREE '(4 3 2 1))) ==> (4 3 2 1) (GEN-DEPTH-FIRST-LISTING (CREATE-BIN-TREE '(2 4 3 1))) ==> (2 1 4 3) (GEN-DEPTH-FIRST-LISTING BIG-TREE) ==> (999 37 55 23 100 77 92) T CL-USER(12):