We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 9f24a59 commit 26808ccCopy full SHA for 26808cc
leetcode/medium/113_path_sum_II.md
@@ -6,7 +6,7 @@
6
- N = Number of nodes in tree
7
8
There are a few things that need to be added outside of a normal traversal of a binary tree.
9
-Outside of these things, everything else is a post order traversal.
+Outside of these things, everything else is a pre-order traversal (node -> left -> right).
10
11
1. Keep track of the sum as we traverse.
12
2. Have a result we can modify as we traverse.
0 commit comments