Which are true for binary search tree?

Question

Answer

Search operation may take O(N).

Answer

Search operation may take O(log N).

Answer

Search operation may take O(N log N).

Answer

Each node has exactly two child nodes.

Answer

Key of left child node is smaller than key of parent node, k ey of right child node is larger than key of parent node .

Answer

Each node has up to two child nodes .

Answer

It is a binary tree.

Answer

Root node always stores the largest key.

Crowdly