In a binary search tree (arbre binaire de recherch...

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

Question Number 5

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

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

Question Number 5

Count Down:

Related questions :