What do you mean by heap tree? What is the smallest value in binary search tree at left most root? What is the largest value in binary search tree at right most root?

Name: CSE 1729 - Week 10 Notes – 3/21/18
Brand: StudySoup
SKU: 2675441
Price: 45.00 USD
Availability: InStock
Rating: 5 (1 reviews)

CSE 1729- Week 10Notes – 3/21/18 (define (extract-sortedT) (if (null? T) ‘() (append (extract-sorted(left T)) (list (value T)) (extract-sorted (right T))))) • One can use this machinery to sort by inserting the elements into the search tree, and then extracting the sorted list. • Smallest value in binary search tree at left most root • Largest value in binary search tree at right most root Deleting value in a tree: • Leaf = simply remove • Tree withone empty subtree = attach non-empty subtree where value was • Both subtrees non-empty: o Replace value with smallest of right or largest of left o Move wholeleft