A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ……A AVL treeB Red-black treeC Lemma treeD None of the above

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 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

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 child of a node contains a value less than or equalto the node's value.*1 pointTRUEFALSE

Every binary tree is also a binary search treeGroup of answer choicesTrueFalse