Teaching Rajasthan Basic Computer Instructor 2021 Mock Test Programming and Data Structure Binary Heap Binary Search Tree
If we delete Node 15 from the given BST the pre-order traversal of the resultant tree is:
1
20, 10, 2, 16, 12, 17, 19, 30, 27
2
20, 10, 12, 2, 17, 16, 19, 30, 27
3
20, 2, 10, 16, 12, 17, 19, 30, 27
4
20, 12, 10, 2, 17, 16, 19, 30, 27