8000 modified README.md · TopWork0ut/C-Cpp-algorithms@117898a · GitHub
[go: up one dir, main page]
Skip to content

Commit 117898a

Browse files
TopWork0utTopWork0ut
committed
modified README.md
1 parent b61c2b9 commit 117898a

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

‎README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
### Finding the minimum depth of a binary tree
44

5-
![Fisrt](/Lab2/assets/results/Binary-Tree-Minimum-Depth.png)
5+
![Fisrt](/Lab2/assets/Binary-Tree-Minimum-Depth.png)
66

77
Given a binary tree, find its minimum depth. The minimum depth is the total number of nodes along the shortest path from the root node to the nearest end node.
88

0 commit comments

Comments
 (0)
0