mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-02-25 18:38:39 +00:00
Code Issues Packages Projects Releases Wiki Activity

changed rigt->right, a typo fix.

Browse Source
This commit is contained in:
Alvin Nguyen 2017-10-09 17:05:14 -07:00
parent dc5e86b701
commit ab058ab0b5
2 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
data_structures/Binary Tree/binary_seach_tree.py
View File

@ -8,7 +8,7 @@ class Node:
def __init__(self, label): def __init__(self, label):
self.label = label self.label = label
self.left = None self.left = None
self.rigt = None self.right = None
def getLabel(self): def getLabel(self):
return self.label return self.label
@ -23,10 +23,10 @@ class Node:
self.left = left self.left = left
def getRight(self): def getRight(self):
return self.rigt return self.right
def setRight(self, right): def setRight(self, right):
self.rigt = right self.right = right
class BinarySearchTree: class BinarySearchTree:

2
data_structures/Graph/Breadth_First_Search.py
View File

@ -67,6 +67,6 @@ print("Enter the edges (u v)")
for i in range(0, e): for i in range(0, e):
u ,v = map(int, raw_input().split()) u ,v = map(int, raw_input().split())
g.add_edge(u, v) g.add_edge(u, v)
s = int(input("Enter the source node :")) s = int(input("Enter the source node :"))
g.bfs(s) g.bfs(s)