Skip to content

Commit 70a2cc5

Browse files
Merge pull request matthewsamuel95#621 from aljazglavac/BST_readme
Added information/documentation about BST into README.md
2 parents 1e5e12a + d859eed commit 70a2cc5

File tree

1 file changed

+9
-0
lines changed

1 file changed

+9
-0
lines changed

BST/README.md

Lines changed: 9 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,9 @@
1+
# Binary Search Tree (BST)
2+
3+
Binary Search Tree is a node-based binary tree data structure which has the following properties:
4+
5+
* The left subtree of a node contains only nodes with keys lesser than the node’s key.
6+
* The right subtree of a node contains only nodes with keys greater than the node’s key.
7+
* The left and right subtree each must also be a binary search tree.
8+
9+
The above properties of Binary Search Tree provide an ordering among keys so that the operations like search, minimum and maximum can be done fast. If there is no ordering, then we may have to compare every key to search a given key.

0 commit comments

Comments
 (0)