Consider the following statements:P: If the root node of a BST is deleted, it can be replaced by inorder predecessor. Q: If the root node of a BST is deleted, it can be replaced by preorder successor. Which of the following is/are CORRECT?

If we want to delete a node with two children in a BST, which node can replace it?Its immediate left childIts immediate right childIts inorder predecessor or inorder successorThe root node

Which of the following is a correct method to delete a node with one child in a BST?Replace the node with its childReplace the node with the rootReplace the node with its inorder predecessorDelete the subtree containing the node

Which node is promoted when a node with more then one child is removed from a BST.AAll the optionsBTravel to the right or left sub tree and choose smallest or biggest respectively.CTravel to the right or left sub tree and choose the biggest or smallest respectively.DAny node can be promoted

The inorder and preorder traversal of a binary tree are Inorder: d b e a p q r PreOrder: a b d e q p r The postorder traversal of the binary tree is: (A) d e b p r q a (B) e d b r p q a (C) e d b p r q a (D) d e p r b q a

In an inorder traversal, the elements of a tree are visited in order of their distance from the root. A. True B. False