This preview shows page 1. Sign up to view the full content.
Unformatted text preview: minimum number of scalar multiplications needed to compute the chain. Problem 2. (24 pts total) The ﬁgure below shows a binary tree. (a) (8 pts) Label the tree with numbers from the set { 1 , 2 , 4 , 5 , 6 , 7 , 8 } so that it is a legal binary search tree. (b) (8 pts) Label each node in the tree with R or B denoting the respective colors RED and BLACK so that the tree is a legal redblack tree. (c) (8 pts) Give the redblack tree that results from inserting the key 3 into the tree of (b)....
View
Full
Document
 Fall '09
 YaoWenChang
 Electrical Engineering

Click to edit the document details