joachim/racket-random
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

format bst

Browse source
This commit is contained in:
joachimschmidt557 2019-09-08 19:18:29 +02:00
parent 7391f2ffeb
commit a0420c2879
1 changed files with 34 additions and 44 deletions
Download patch file Download diff file Expand all files Collapse all files

78
bst.rkt
View file

@ -2,55 +2,45 @@
(define-struct node (value left right))
(define (search node value) (cond
[(= (node-value node) value) node]
[(empty? node) empty]
[(> (node-value node) value) (search (node-left node) value)]
[else (search (node-right node) value)]
))
(define (search node value)
(cond
[(= (node-value node) value) node]
[(empty? node) empty]
[(> (node-value node) value) (search (node-left node) value)]
[else (search (node-right node) value)]))
(define (insert node value) (cond
[(empty? node) (make-node value empty empty)]
[(> (node-value node) value) (make-node (node-value node) (insert (node-left node) value) (node-right node))]
[else (make-node (node-value node) (node-left node) (insert (node-right node) value))]
))
(define (insert node value)
(cond
[(empty? node) (make-node value empty empty)]
[(> (node-value node) value) (make-node (node-value node) (insert (node-left node) value) (node-right node))]
[else (make-node (node-value node) (node-left node) (insert (node-right node) value))]))
(define (bst-from-list lst) (cond
[(empty? lst) empty]
[else (insert (bst-from-list (rest lst)) (first lst))]
))
(define (bst-from-list lst)
(cond
[(empty? lst) empty]
[else (insert (bst-from-list (rest lst)) (first lst))]))
(define (rotate-left node) (if (empty? node) empty (let
(
[x node]
[l (node-left node)]
[r (node-right node)])
(let (
[a (if (empty? l) empty (node-left l))]
[b (if (empty? l) empty (node-right l))]
[c (if (empty? r) empty (node-left r))]
[d (if (empty? r) empty (node-right r))]
) (
(make-node (node-value l)
a
(make-node (node-value x)
b
r)
)
)))))
(define (rotate-left node)
(if (empty? node) empty
(let ([x node] [l (node-left node)] [r (node-right node)])
(let ([a (if (empty? l) empty (node-left l))]
[b (if (empty? l) empty (node-right l))]
[c (if (empty? r) empty (node-left r))]
[d (if (empty? r) empty (node-right r))])
(make-node (node-value l) a (make-node (node-value x) b r))))))
(define (height node) (cond
[(empty? node) 0]
[else (+ 1 (max (height (node-left node)) (height (node-right node))))]
))
(define (height node)
(cond
[(empty? node) 0]
[else (+ 1 (max (height (node-left node)) (height (node-right node))))]))
(define (avlcheck node) (cond
[(empty? node) 0]
[(= (height (node-left node)) -1) -1]
[(= (height (node-right node)) -1) -1]
[(< 1 (abs (- (height (node-left node)) (height (node-right node))))) -1]
[else (+ 1 (max (height (node-left node)) (height (node-right node))))]
))
(define (avlcheck node)
(cond
[(empty? node) 0]
[(= (height (node-left node)) -1) -1]
[(= (height (node-right node)) -1) -1]
[(< 1 (abs (- (height (node-left node)) (height (node-right node))))) -1]
[else (+ 1 (max (height (node-left node)) (height (node-right node))))]))
(define (delete node)
(cond