diff options
| author | James Smith <baggy@baggy.me.uk> | 2021-08-23 18:42:47 +0100 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2021-08-23 18:42:47 +0100 |
| commit | 0b3fe118e08a69d3299ffae68189febdc5ccc963 (patch) | |
| tree | be8de4055636f1816e568dc53dd3c26bd78d2224 /challenge-125 | |
| parent | 5aeb35089f8040e7bdbd2466cb1a63b2c328e7d5 (diff) | |
| download | perlweeklychallenge-club-0b3fe118e08a69d3299ffae68189febdc5ccc963.tar.gz perlweeklychallenge-club-0b3fe118e08a69d3299ffae68189febdc5ccc963.tar.bz2 perlweeklychallenge-club-0b3fe118e08a69d3299ffae68189febdc5ccc963.zip | |
Update README.md
Diffstat (limited to 'challenge-125')
| -rw-r--r-- | challenge-125/james-smith/README.md | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/challenge-125/james-smith/README.md b/challenge-125/james-smith/README.md index 97ebd934cd..1feccd53a9 100644 --- a/challenge-125/james-smith/README.md +++ b/challenge-125/james-smith/README.md @@ -43,7 +43,7 @@ sub get_triples { ``` # Task 2 - Binary Tree Diameter -*** Write a script to find the diameter of the given binary tree. The diameter of a binary tree is the length of the longest path between any two nodes in a tree. It doesn’t have to pass through the root.*** +***Write a script to find the diameter of the given binary tree. The diameter of a binary tree is the length of the longest path between any two nodes in a tree. It doesn’t have to pass through the root.*** ## Solution |