Search operation may take O(N).

Search operation may take O(log N).

Search operation may take O(N log N).

Each node has exactly two child nodes.

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

Each node has up to two child nodes.

It is a binary tree.

Root node always stores the largest key.