You are right about the space consumption:
(1) -> y := binarySearchTree [3,2,6,4,5,1]
(1) [[1,2,.],3,[[.,4,5],6,.]]
Type:
BinarySearchTree(PositiveInteger)
(2) -> y pretend SEX
(2) ((0 3 (0 2 (0 1))) (0 6 (0 4) (0 5)))
Type:
SExpression
after patch:
(2) -> y pretend SEX
(2)
(0 .
#(3 (0 . #(2 (0 . #(1 (1 . #1=empty) (1 . #1#))) (1 . #1#)))
(0 . #(6 (0
. #(4 (1 . #1#) (0 . #(5 (1 . #1#) (1 . #1#))))) (1 . #1#))))
)
Type:
SExpression
So, current Rep for binary tree may be the best...
Although that's a bit anti-intuitive. The problem is
in Record.
--
You received this message because you are subscribed to the Google Groups
"FriCAS - computer algebra system" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at https://groups.google.com/group/fricas-devel.
For more options, visit https://groups.google.com/d/optout.
