Problem Statement

Preorder Traversal After Deleting Two BST Nodes Construct a binary search tree by inserting the following elements in the given order: 50 60 30 52 35 33 34 22 What will be the pre-order traversal of the resulting tree after deleting node 50 and then node 30? (A node with two children is replaced by its in-order predecessor.)