To construct a full binary tree using the keys 20, 30, 33, 35, 39, 40, 50, 60, 100, you could insert the keys in the following order: 50, 30, 60, 20, 40, 35, 100, 33, 39.
This insertion order will result in a full binary tree with the following structure:
50
/ \
30 60
/ \ / \
20 40 35 100
/
33
/
39
A full binary tree is a tree in which every node has either zero or two children. To construct a full binary tree using a given set of keys, you can insert the keys into the tree in a specific order, starting with the median key and then inserting the remaining keys in a way that maintains the fullness of the tree.
For example, in the case above, we started by inserting the median key (50) as the root of the tree. We then inserted the keys on either side of the median key (30 and 60) as the left and right children of the root, respectively.
To Know More About binary tree, Check Out
https://brainly.com/question/13152677
#SPJ4
