Answer to Question #201326 in Discrete Mathematics for Melissa Yong

Question

Draw a binary search tree by inserting the values 50, 76, 21, 4, 32, 64, 15, 52, 14, 100, 83, 2, 3 and 70.

Answer 1

Values :  50, 76, 21, 4, 32, 64, 15, 52, 14, 100, 83, 2, 3 and 70.

Rules:

• A parent node has, at most, 2 child nodes.
• The left child node is always less than the parent node.
• The right child node is always greater than or equal to the parent node.

Binary Search Tree:

Steps:

Answer: