Bac NSI Practice Questions - Baccalaureat General - Specialite Numerique Et Sciences Informatiques (NSI) Exam

In a binary search tree (arbre binaire de recherche, ABR), what property holds for every node?

All keys in the left subtree are less than the node's key and all keys in the right subtree are greater All keys in the left subtree are greater than the node's key The tree is always perfectly balanced Each node has exactly two children

Correct Answer:

All keys in the left subtree are less than the node's key and all keys in the right subtree are greater

Access more questions from this quiz

Continue to Bac NSI Practice Questions - Baccalaureat General - Specialite Numerique et Sciences Informatiques (NSI) Exam for more practice questions and the full quiz experience.

Access More Questions