Binary Search Trees

suggest change


Binary tree is a tree that each node in it has maximum of two children. Binary search tree (BST) is a binary tree which its elements positioned in special order. In each BST all values(i.e key) in left sub tree are less than values in right sub tree.

Feedback about page:

Optional: your email if you want me to get back to you:

Table Of Contents