Commit d484c9a

committed

added Check Valid Tree Given Edges (Others)

1 parent 435e5c3 commit d484c9aCopy full SHA for d484c9a

File tree

+43

-0

lines changed

+43

-0

lines changed

Lines changed: 23 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,23 @@`
	`1`	`+# Check Valid Tree Given Edges`
	`2`	`+`
	`3`	`+## Problem:`
	`4`	`+`
	`5`	`+Given n nodes labeled from 0 to n-1 and a list of undirected edges (each edge is a pair of nodes), write a function to check whether these edges make up a valid tree.`
	`6`	`+`
	`7`	`+## Example:`
	`8`	`+`
	`9`	+```
	`10`	`+Input: n = 4, edges = [(0,1), (2,0), (3,2)]`
	`11`	`+Output: true`
	`12`	`+ 0`
	`13`	`+ / \`
	`14`	`+ 1 2`
	`15`	`+ /`
	`16`	`+ 3`
	`17`	`+`
	`18`	`+Input: n = 4, edges = [(0,1), (0,2), (2,1), (0,3)]`
	`19`	`+Output: false`
	`20`	`+ 0`
	`21`	`+ / \| \`
	`22`	`+ 1 - 2 3`
	`23`	+```

Lines changed: 16 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,16 @@`
	`1`	`+def isValidEdges(n, edges):`
	`2`	`+ connected = set()`
	`3`	`+ for a, b in edges:`
	`4`	`+ if a in connected and b in connected:`
	`5`	`+ return False`
	`6`	`+ connected.add(a)`
	`7`	`+ connected.add(b)`
	`8`	`+ return True`
	`9`	`+`
	`10`	`+`
	`11`	`+n = 4`
	`12`	`+edges = [(0, 1), (2, 0), (3, 2)]`
	`13`	`+print(isValidEdges(n, edges))`
	`14`	`+`
	`15`	`+edges = [(0, 1), (0, 2), (2, 1), (0, 3)]`
	`16`	`+print(isValidEdges(n, edges))`

Lines changed: 4 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -92,6 +92,7 @@ Languages used: Java and Python`
`92`	`92`	`- [Reverse Linked List II](Medium/ReverseLinkedList2)`
`93`	`93`	`- [Binary Tree Postorder Traversal](Medium/BinaryPostorder)`
`94`	`94`	`- Hard`
	`95`	`+`
`95`	`96`	`- [Maximum Score Words Formed by Letters](Hard/MaximumScoreWords)`
`96`	`97`	`- [Reducing Dishes](Hard/ReducingDishes)`
`97`	`98`	`- [Longest Consecutive Sequence](Hard/LongestConsecutiveSequence)`
`@@ -101,6 +102,9 @@ Languages used: Java and Python`
`101`	`102`	`- [Escape a Large Maze](Hard/EscapeLargeMaze)`
`102`	`103`	`- [Serialize and Deserialize Binary Tree](Hard/SerializeAndDeserializeBinaryTree)`
`103`	`104`
	`105`	`+- Others (Non-leetcode)`
	`106`	`+ - [Check Valid Tree Given Edges](Others/CheckValidTreeGivenEdges)`
	`107`	`+`
`104`	`108`	`---`
`105`	`109`
`106`	`110`	`# Challenge_README_Template`

Comments

(0)