Consider the given binary tree and answer the following questions: a) Perform inorder, preorder, and postorder traversals and show the result. b) If one node is deleted, explain which node will replace it in a complete binary tree.

You are given the following sequence of numbers to insert into a BST: 50, 30, 70, 20, 40, 60, 80 a) Construct the BST. b) Show the steps to search for the key 40. c) If node 30 is deleted, which node will replace it? Justify your answer.

Insert and delete elements in a Binary Search Tree (BST) using the numbers 33, 50, 45, 52, 12, 10. Draw the tree after each operation.

Compare and contrast BSTs and heaps. When would you prefer one over the other?

Define complete binary tree. Traverse the given tree using In-order, Preorder and Post-order traversals.