Skip to content

All done #21

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
seadrahbe wants to merge 2 commits into
base: main
Choose a base branch
from
Open

All done #21

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
3253d98
Finished printNegativeNodesInOrder
seadrahbe Jun 5, 2026
f30a167
Finished sumLeafNodes
seadrahbe Jun 5, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
16 changes: 15 additions & 1 deletion src/TraversalPractice.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -10,7 +10,15 @@ public class TraversalPractice {
* @param node the root of the tree
*/
public static void printNegativeNodesInOrder(TreeNode node) {
if (node == null) return;

printNegativeNodesInOrder(node.left);

if (node.data < 0 ) {
System.out.println(node.data);
}

printNegativeNodesInOrder(node.right);
}

/**
Expand All @@ -37,6 +45,12 @@ public static void printNegativeNodesInOrder(TreeNode node) {
* @return the sum of the leaf node values
*/
public static int sumLeafNodes(TreeNode node) {
return -1;
if (node == null) return 0;

if (node.left == null && node.right == null) {
return node.data;
}

return sumLeafNodes(node.left) + sumLeafNodes(node.right);
}
}