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

A binary search tree is a binary tree where:Group of answer choicesThe data in the tree is stored in a specific order.It is always a complete binary tree.The left subtree contains values less than the root, and the right subtree contains values greater than the root.Both b and d.

Which acronym is used to represent the Binary Search Tree in C++?Instruction: Choose the option that best answers the question. Answer ChoicesBSTnodeintpublic

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 ChoicesThe appropriate leaf node or target node must be found in the tree to attach the new nodeThe root node must be found in the tree to attach the new nodeThere 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 nodeSave and exitSubmit answer

Where is the maximum number in a binary search tree? a) At the root of the tree. b) Anywhere other than root and leaf nodes c) At the leftmost leaf node. d) At the rightmost leaf node

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