In a Binary Search Tree, the left subtree of a node contains only nodes with keys _______ the node’s key.greater thanless thanequal togreater than or equal to

In a Binary Search Tree, the left subtree of a node contains only nodes with keys _______ the node’s key.

In a binary search tree, the left child of a node contains a value less than or equalto the node's value.*1 pointTRUEFALSE

Which of the following is true for a Binary Search Tree?Left and right subtrees contain duplicate elementsRight subtree contains all elements less than the rootLeft subtree contains all elements greater than the rootNone of the above

Which of the following is true for a Binary Search Tree?

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.