Skip to content

Commit 6a1ab0e

Browse files
iamAntimPalAntim-IWPIamShiwangi
committed
Update readme.md
Co-Authored-By: Antim-IWP <203163676+Antim-IWP@users.noreply.github.com> Co-Authored-By: Shiwangi Srivastava <174641070+IamShiwangi@users.noreply.github.com>
1 parent 5326bdb commit 6a1ab0e

File tree

1 file changed

+1
-8
lines changed
  • Solution/1372. Longest ZigZag Path in a Binary Tree

1 file changed

+1
-8
lines changed

Solution/1372. Longest ZigZag Path in a Binary Tree/readme.md

Lines changed: 1 addition & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -1,10 +1,6 @@
1-
Sure! Here's the full `README.md` in the LeetCode-style format, exactly like in the `doocs/leetcode` GitHub repo, for **1372. Longest ZigZag Path in a Binary Tree**:
21

3-
---
4-
5-
```markdown
62
# [1372. Longest ZigZag Path in a Binary Tree](https://leetcode.com/problems/longest-zigzag-path-in-a-binary-tree)
7-
3+
---
84
## Description
95

106
You are given the `root` of a binary tree.
@@ -183,6 +179,3 @@ func max(a, b int) int {
183179
}
184180
```
185181

186-
---
187-
188-
Let me know if you want this in other languages or with a visual diagram too!

0 commit comments

Comments
 (0)