计算树形方案中的重复值

Question

我正在尝试计算树中的重复项。我附上一张照片以获得更好的说明。我走错路了，我无处可去。这是我所做的

(define (arbre-insere valeur arbre) 
  (cond ((null? arbre) (list (cons valeur 1) '() '())) 
            ((< valeur(car arbre)) 
                (list (cons  (car arbre) count) 
                      (arbre-insere valeur (cadr arbre)) 
                                       (caddr arbre))) 
            (> valeur(car arbre) (list cons ((car arbre) count) (cadr arbre) 
                  (arbre-insere valeur (caddr arbre) )))
            (else

             )
            ))][1]

Answer 1

这是一张草图，其中 ... 和 <...> 中的内容由您填写。

(define leaf '())

; leaf? : tree -> boolean
;   return #t if the tree is a leaf,
;          #f otherwise
(define (leaf? tree)
  (null? leaf?))

; value : tree -> element
;   return the root element of the tree
(define (value tree) 
  ...)

; count : tree -> integer
;   return the count of the root element of tree
(define (count tree)
  ...)

; left : tree -> tree
;   return the left subtree of tree
(define (left tree)
  ...)

; right : tree -> tree 
;   return the right subtree of tree
(define (right tree)
  ...)

; make-node : value integer tree tree
;   construct tree from a value and count, 
;   left is a tree whose elements are smaller than value
;   right is a tree whose elements are greater than value
(define (make-node value count left right)
  (list left (cons value count) right))

; tree-insert : value tree -> tree
(define (tree-insert v t)
  (cond
    [(leaf? t)        (make-tree v 1 leaf leaf)]
    [(= v (value t))  (make-tree v <old-count+1> (left t) (right t))]
    [(< v (value t))  (make-tree v (make-node (value t) (count t) 
                                              (insert-tree v (left t)) r))]
    [(> v (value t))  <???>]
    [else (error 'tree-insert "an unexpected error occurred")]))

计算树形方案中的重复值

count duplicate value in a tree scheme

scheme