Question

show all steps-python

Review the following BST and create the inorder, preorder and postorder list.

Try to delete the value 17 and after deletion create the inorder, preorder and postorder list.

Follow both algorithms.  If the node has a left child and a right child, 1) replace the node’s value with the largest value
in the left subtree and delete that value’s node from the left subtree.

Or 2) replace the node’s value with the smallest value in the right subtree and delete that value’s node from the right subtree.

Try to insert the value 100 in the BST.

50) (17 (72) 12 (23 (54) 76 9 14) (19) 67)

Answer 1

= rapeau! ☺ Or 9 12 14 17 19 Er 50 54 67 72 76 preorded - 50 17 12914 23 19 72 54 67 76 postorded - 9 14 12 19 23 17 67 54 767250 z delte 17 case ) case-2 50 50 1ч 42 19 72 23 54 76 23 54 76 19 67 14 67 3 col anpon prasul '50. 17 72 23 (54 76 14 19 67 100