Question
In algorithms, what is the characteristic that makes a binary tree, a Binary Search Tree (BST)?
In a BST, for a given node with a value, all the nodes in the left sub-tree are less than or equal to the value of that node, and all the nodes in the right sub-tree of this node are greater than the value of that node.

Question
In algorithms, what is the characteristic that makes a binary tree, a Binary Search Tree (BST)?
?

Question
In algorithms, what is the characteristic that makes a binary tree, a Binary Search Tree (BST)?
In a BST, for a given node with a value, all the nodes in the left sub-tree are less than or equal to the value of that node, and all the nodes in the right sub-tree of this node are greater than the value of that node.
If you want to change selection, open document below and click on "Move attachment"

#### pdf

owner: kkhosravi - (no access) - PYTHON_DATA_STRUCTURES_AND_ALGORITHMS.pdf, p150

#### Summary

status measured difficulty not learned 37% [default] 0

No repetitions