previous
|
index
|
next
Traversal Application: Creating Balanced Trees from Unbalanced Trees
Wanted:
(balance unbalanced-tree)
produces:
Straightforward:
get the
inorder
list of nodes, then
use
sorted-list->balanced-bstree
on that list
This is Exercise 8.13, p. 224.
previous
|
index
|
next