Question

Complete the sequence to produce a skew Binary Search Tree (BST) from the given set: 2, 5, 8, 3, 9, 1, 7, 12, 6, 0.

a) 0, 1, 2, 3, 5, 6, 7, 8, 9, 12
b) 12, 9, 8, 7, 6, 5, 3, 2, 1, 0
c) 0, 2, 1, 3, 5, 6, 7, 8, 9, 12
d) 12, 8, 9, 7, 6, 5, 3, 2, 1, 0

Answer 1

A skew Binary Search Tree (BST) is created by inserting each element as the right child of the previous element, resulting in a tree where the left child of each node has a higher key value than the node itself.

Step-by-step explanation:

A skew Binary Search Tree (BST) is a type of binary search tree where the left child of each node has a higher key value than the node itself.

To create a skew BST from the given set {2, 5, 8, 3, 9, 1, 7, 12, 6, 0}, we can start by inserting the elements in order. The correct sequence to produce a skew BST is option D: 12, 8, 9, 7, 6, 5, 3, 2, 1, 0.

In this sequence, each element is inserted as the right child of the previous element, resulting in a skewed tree where all nodes have a higher key value than their left child.