mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-27 23:11:09 +00:00
changed rigt->right, a typo fix.
This commit is contained in:
parent
dc5e86b701
commit
ab058ab0b5
|
@ -8,7 +8,7 @@ class Node:
|
|||
def __init__(self, label):
|
||||
self.label = label
|
||||
self.left = None
|
||||
self.rigt = None
|
||||
self.right = None
|
||||
|
||||
def getLabel(self):
|
||||
return self.label
|
||||
|
@ -23,10 +23,10 @@ class Node:
|
|||
self.left = left
|
||||
|
||||
def getRight(self):
|
||||
return self.rigt
|
||||
return self.right
|
||||
|
||||
def setRight(self, right):
|
||||
self.rigt = right
|
||||
self.right = right
|
||||
|
||||
|
||||
class BinarySearchTree:
|
||||
|
|
|
@ -67,6 +67,6 @@ print("Enter the edges (u v)")
|
|||
for i in range(0, e):
|
||||
u ,v = map(int, raw_input().split())
|
||||
g.add_edge(u, v)
|
||||
|
||||
|
||||
s = int(input("Enter the source node :"))
|
||||
g.bfs(s)
|
||||
|
|
Loading…
Reference in New Issue
Block a user