Bishiyar tanadit tana tanaditawa ita ce bishiyar tanadit tare da tsari mai yakini : ga kowane noda, duk mabugi a cikin subtree na hagu suna ƙarami, kuma duk mabugi a cikin subtree na dama suna girma. Hakan yana ba ka dama ka nemi ta rarraba matsala a kowane mataki.
8
/ \
3 10
/ \ \
1 6 14 left < node < right at every node
def search(node, key):
while node:
if key == node.val: return node
node = node.left if key < node.val else node.right # go one way
return None
def insert(node, key):
if node is None: return Node(key)
if key < node.val: node.left = insert(node.left, key)
else: node.right = insert(node.right, key)
return node
| Aiki | Daidai | Mafi mungu (lalacce) |
|---|---|---|
| search | O(log n) | O(n) |
| insert | O(log n) | O(n) |
| delete | O(log n) | O(n) |
Mafi mungu case yana faruwa lokacin da a saka mabugi a jerin — bishiya ta lalacce zuwa jerin gadowa da tsayi n.
BSTs suna ba ka data wanda aka jera, mai haɗari tare da ayyukan logarithmic — magajija ka abin tunanin indexes na database da maps ɗin jera.
Makarantar lalacce na tana motsa bishiyoyin daidaituwa-kansu, muhimmin jira suje a tattaunawa.