Given the following labeled data structure B D H M Assume that values ara inserted Into the binary search tree (BST) in the following order: 20, 35, 5. 19, 3, 28, 26 16, 4,31, 50, 42 Match the labels...

Extracted text: Given the following labeled data structure B D H M Assume that values ara inserted Into the binary search tree (BST) in the following order: 20, 35, 5. 19, 3, 28, 26 16, 4,31, 50, 42 Match the labels in each node showwn in the diagram with the value that the node vl contain after all the values have bean inseted into the Binary Search Tree. (Note: Some nodes will not have a value)


Extracted text: 20 Choose] 35 Choose] 19 [Choose] 28 [Choose] 26 [Choose] 16 [Choose] [Choose] 31 [Choose] [Choose] 42 [Choose]