Commit e1a3f13

committed

fix: prevent error if passed word not present in the list

1 parent 1a70a93 commit e1a3f13Copy full SHA for e1a3f13

File tree

+14

-4

lines changed

+14

-4

lines changed

Lines changed: 7 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -25,8 +25,13 @@ def main():`
`25`	`25`	`if word == '':`
`26`	`26`	`break`
`27`	`27`
`28`		`- print(`
`29`		`- f'Number of comparison for word "{word}": {numOfComparisons(root_node, word, words)}\n')`
	`28`	`+ comparisons = numOfComparisons(root_node, word, words)`
	`29`	`+`
	`30`	`+ if comparisons == -1:`
	`31`	`+ print(f'Word {word} not found in the tree\n')`
	`32`	`+ else:`
	`33`	`+ print(`
	`34`	`+ f'Number of comparison for word "{word}": {comparisons}\n')`
`30`	`35`
`31`	`36`
`32`	`37`	`if __name__ == '__main__':`

Lines changed: 7 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -4,11 +4,16 @@ def numOfComparisons(root_node, searched_word, words):`
`4`	`4`
`5`	`5`	`One level of the tree equals one comparison.`
`6`	`6`
`7`		`- If word isnt present in the tree, prints out message`
	`7`	`+ Returns number of comparisons on success, -1 if word not in the list`
`8`	`8`	`"""`
`9`	`9`
`10`	`10`	`count = 0`
`11`		`- searched_value = words.index(searched_word)`
	`11`	`+`
	`12`	`+ try:`
	`13`	`+ searched_value = words.index(searched_word)`
	`14`	`+ except:`
	`15`	`+ return -1`
	`16`	`+`
`12`	`17`	`actual_node = root_node`
`13`	`18`
`14`	`19`	`while True:`

Comments

(0)