What is required in order to insert a new node into a Binary Search Tree, or BST?Instruction: Choose the option that best answers the question. Answer ChoicesThere are no requisites when attaching new nodes into a BSTThe appropriate leaf node or terminating node must be found in the tree to attach the new nodeThe root node must be found in the tree to attach the new nodeThe appropriate leaf node or target node must be found in the tree to attach the new node

How to insert a new node to Binary Search Tree? a. Insert a new node as the last element of the last level and call heapify() method b. Starting from the root go to the right or left child of each node according to the new node`s key recursively till it finds an empty position c. Place a new node as the root of BST and set a previous root as a right child of a new root d. None of the above e. Starting from the root go to the right or left child of each node according to the new node`s key recursively till it finds a node with the same key

Explain the process of inserting nodes into a binary search tree.give the answer for 5 marks

What is the starting point when searching a Binary Search Tree?Instruction: Choose the option that best answers the question. Answer Choicesthe root nodethe left nodethe right nodethe target node

Insertion of a Node in B-Tree happens at_________

When implementing a node insertion in a binary tree we need to considerQuestion 33Select one:the case of parent node and the case of child nodecross outthe case of a leaf node and the case of an internal nodecross outonly the case of the root nodecross outthe case of left node and the case of right node