4. Starting from an empty tree, use the insert procedure to construct a binary tree given the following character sequence: F, D, H, B, J, K, C, A, E, G, and L. (12 points) Show transcribed image text 4. Starting from an empty tree, use the insert procedure to construct a binary tree given the following character sequence: F, D, H, B, J, K, C, A, E, G, and L. (12 points)
Answer
Given
OR
OR