From 4f1fb5c53404dbedcca55ba079ccf288dce2f519 Mon Sep 17 00:00:00 2001
From: Gulyapas Poonkawinsiri <67386394+joetlobb@users.noreply.github.com>
Date: Wed, 21 May 2025 11:54:19 -0700
Subject: [PATCH 1/4] complete the live code

---
 src/Traversal.java | 24 ++++++++++++++++++++++++
 src/TreeNode.java  |  7 ++++++-
 2 files changed, 30 insertions(+), 1 deletion(-)

diff --git a/src/Traversal.java b/src/Traversal.java
index 8da0f79..d406390 100644
--- a/src/Traversal.java
+++ b/src/Traversal.java
@@ -1,5 +1,29 @@
 public class Traversal {
   public static void main(String[] args) {
+    TreeNode root = new TreeNode(10);
+    
+    root.left = new TreeNode(9);
+    root.right = new TreeNode(15);
+
+    root.left.left = new TreeNode(5);
+    root.left.right = new TreeNode(2);
+
+    root.right.left = new TreeNode(-3);
+    root.right.right = new TreeNode(5);
+
+    root.right.right.right = new TreeNode(22);
+  }
+
+  public static void preorder (TreeNode current) {
+    // if null: return
+    // print data
+    // search left
+    // search right
+    
+    if (current == null) return;
+    System.out.println(current.data);
+    preorder(current.left);
+    preorder(current.right);
 
   }
 }
diff --git a/src/TreeNode.java b/src/TreeNode.java
index acd9639..e5c6e65 100644
--- a/src/TreeNode.java
+++ b/src/TreeNode.java
@@ -1,4 +1,9 @@
 public class TreeNode {
+    public int data;
+    public TreeNode left;
+    public TreeNode right;
 
-  
+    public TreeNode (int data) {
+        this.data = data;
+    }
 }
\ No newline at end of file

From 603ae9730bff27f0fa37210ac830bb5929d42106 Mon Sep 17 00:00:00 2001
From: Gulyapas Poonkawinsiri <67386394+joetlobb@users.noreply.github.com>
Date: Wed, 28 May 2025 11:43:17 -0700
Subject: [PATCH 2/4] complete sum method

---
 src/Traversal.java | 16 +++++++++++-----
 1 file changed, 11 insertions(+), 5 deletions(-)

diff --git a/src/Traversal.java b/src/Traversal.java
index d406390..245f467 100644
--- a/src/Traversal.java
+++ b/src/Traversal.java
@@ -12,18 +12,24 @@ public static void main(String[] args) {
     root.right.right = new TreeNode(5);
 
     root.right.right.right = new TreeNode(22);
+
+    int result = sum(root);
+    System.out.println(result);
   }
 
   public static void preorder (TreeNode current) {
-    // if null: return
-    // print data
-    // search left
-    // search right
-    
     if (current == null) return;
     System.out.println(current.data);
     preorder(current.left);
     preorder(current.right);
 
   }
+
+  public static int sum (TreeNode node) {
+    if (node == null) return 0;
+    int total = node.data;
+    total += sum(node.left);
+    total += sum(node.right);
+    return total;
+  }
 }

From ba013294a4c631cfdccd9bc9c6ea5caa1275cba5 Mon Sep 17 00:00:00 2001
From: Gulyapas Poonkawinsiri <67386394+joetlobb@users.noreply.github.com>
Date: Wed, 28 May 2025 11:43:42 -0700
Subject: [PATCH 3/4] complete oddSum method

---
 src/Traversal.java | 11 +++++++++++
 1 file changed, 11 insertions(+)

diff --git a/src/Traversal.java b/src/Traversal.java
index 245f467..5e10858 100644
--- a/src/Traversal.java
+++ b/src/Traversal.java
@@ -32,4 +32,15 @@ public static int sum (TreeNode node) {
     total += sum(node.right);
     return total;
   }
+
+  public static int oddSum (TreeNode node) {
+    if (node == null) return 0;
+    int total = 0;
+    if (node.data % 2 != 0) {
+      total += node.data;
+    }
+    total += oddSum(node.left);
+    total += oddSum(node.right);
+    return total;
+  }
 }

From 514973a65c233297d84b64f256c5eb102e3b1e47 Mon Sep 17 00:00:00 2001
From: Gulyapas Poonkawinsiri <67386394+joetlobb@users.noreply.github.com>
Date: Wed, 28 May 2025 11:45:28 -0700
Subject: [PATCH 4/4] call oddSum method in main

---
 src/Traversal.java | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/src/Traversal.java b/src/Traversal.java
index 5e10858..b877d72 100644
--- a/src/Traversal.java
+++ b/src/Traversal.java
@@ -15,6 +15,8 @@ public static void main(String[] args) {
 
     int result = sum(root);
     System.out.println(result);
+    result = oddSum(root);
+    System.out.println(result);
   }
 
   public static void preorder (TreeNode current) {