Answer the following questions using python and without using any of its libraries or OOP . a) Using the helper function insert (bst, key), create the binary search tree that results from inserting the following keys in the order given: 68, 88, 61, 89, 94, 50, 4, 76, 66, and 82. b) Using the helper function exist (bst, key), check whether key 50 exists in resultant Binary Search Tree. c) Using the helper function exist (bst, key), check whether key 49 exists in resultant Binary Search Tree. d) Using the helper function minimum (bst, starting_node), find the node with the minimum value in resultant Binary Search Tree from starting node = 68. e) Using the helper function minimum (bst, starting_node), find the node with the minimum value in resultant Binary Search Tree from starting node = 88. f) Using the helper function maximum (bst, starting_node), find the node with the maximum value in resultant Binary Search Tree from starting node = 68.
Answer the following questions using python and without using any of its libraries or OOP .
a) Using the helper function insert (bst, key), create the binary search tree that results from inserting the following keys in the order given: 68, 88, 61, 89, 94, 50, 4, 76, 66, and 82.
b) Using the helper function exist (bst, key), check whether key 50 exists in resultant Binary Search Tree.
c) Using the helper function exist (bst, key), check whether key 49 exists in resultant Binary Search Tree.
d) Using the helper function minimum (bst, starting_node), find the node with the minimum value in resultant Binary Search Tree from starting node = 68.
e) Using the helper function minimum (bst, starting_node), find the node with the minimum value in resultant Binary Search Tree from starting node = 88.
f) Using the helper function maximum (bst, starting_node), find the node with the maximum value in resultant Binary Search Tree from starting node = 68.
g) Using the helper function maximum (bst, starting_node), find the node with the maximum value in resultant Binary Search Tree from starting node = 61. CS 102– Data Structures &
h) Using the helper function inorder_traversal (bst), perform in-order traversal of the Binary Search Tree.
i) Using the helper function preorder_traversal (bst), perform pre-order traversal of the Binary Search Tree.
j) Using the helper function postorder_traversal (bst), perform post-order traversal of the Binary Search Tree.
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 3 images
