In a binary search tree, what is the property that ensures all nodes in the left subtree have smaller values, and all nodes in the right subtree have larger values than the root node?Group of answer choicesHeight balanceHeap propertySearch propertyBinary property

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

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?

Which property does an AVL tree guarantee that is not guaranteed by a regular binary search tree?APath length balanceBPerfectly balanceCHeight balanceDComplete balance