Binary Search Trees
suggest changeIntroduction
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.
Found a mistake? Have a question or improvement idea?
Let me know.
Table Of Contents