1- The
left and right subtree each must also be a binary search tree.
2- There must be no duplicate nodes
3- The 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.
2- There must be no duplicate nodes
3- The 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.
Reference: http://www.geeksforgeeks.org/binary-search-tree-set-1-search-and-insertion/
This work is licensed under a Creative Commons Attribution 4.0 International License.
No comments:
Post a Comment