Question

In Data Structures, if you are working on a Binary Search Tree, then which of the following properties of this data structure are correct:

1. The left subtree of a node contains only nodes with keys lesser than the node's key.

2. The right subtree of a node contains only nodes with keys lesser than the node's key.

3. The left and right subtree each must also be a binary search tree.

Which one is correct?
a) 1 and 3
b) 2 and 3
c) 1 and 2
d) All of these​

Answer 1

I think A is right answer

Answer 2

Answer:

Option C

Explanation:

Data Structures in the computer programming is used for merging and managing data.It actions more actively and also tasks are finished on time.Array is fixed in this and also holds the items for equal data.

Binary Search follow some line of items to arrange the elements.It is used for deleting or inserting the nodes.

#SPJ2