In a binary search tree, the left subtree of a node contains only nodes with keys _________ than the node's key.

  • Equal or greater
  • Equal or lesser
  • Greater
  • Lesser
In a binary search tree, the left subtree of a node contains only nodes with keys lesser than the node's key. This property ensures efficient searching and retrieval of elements.
Add your answer
Loading...

Leave a comment

Your email address will not be published. Required fields are marked *