For a binary search tree, which of the following holds?

1
node.left.key > node.key < node.right.key
2
node.left.key < node.key < node.right.key
3
node.key > node.left.key, node.right.key
4
node.key < node.left.key, node.right.key

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Quick Navigation