Question

show the binary tree built from a sequence of insertion for the following sequence of keys: 8,17,10,15,5,2,16,19,13,1,4,11​

Answer 1

Answer:

A binary tree is made of nodes, where each node contains a "left" reference, a "right" ... PreOrder - 8, 5, 9 , 7, 1, 12, 2, 4, 11, 3 ... The insertion procedure is quite similar to searching. ... 11, 6, 8, 19, 4, 10, 5, 17, 43, 49, 31.

Explanation:

hope it may help you