Question

Write a code to implement Binary Search Tree (BST). Test your program with the following data= [27, 5, 12, 85, 6, 19, 1, 8, 95, 3]. Traverse your BST as;

a) In-order

b) Pre-order

c) Post-order

Copy the code and screenshots of your output into a Word document and submit it as your Portfolio Assignment with your response to the following question:

How do in-order, pre-order, and post-order differ from each other when we

Answer 1

The in-order traversal visits nodes in ascending order, pre-order visits root first, and post-order visits root last.

Step-by-step explanation:

In a binary search tree (BST), the in-order traversal visits the nodes in ascending order. In the case of the given data [27, 5, 12, 85, 6, 19, 1, 8, 95, 3], the in-order traversal would visit the nodes in the order: 1, 3, 5, 6, 8, 12, 19, 27, 85, 95.

The pre-order traversal visits the nodes in the following order: root, left subtree, right subtree. For the given data, the pre-order traversal would be: 27, 5, 1, 3, 12, 6, 8, 19, 85, 95.

The post-order traversal visits the nodes in the following order: left subtree, right subtree, root. For the given data, the post-order traversal would be: 3, 1, 8, 6, 19, 12, 5, 95, 85, 27.