From eb6b1afc7d5e47df5424c32996ae9cd021b63ec2 Mon Sep 17 00:00:00 2001
From: Iquer_Dough <206500499+DennysSaenz123@users.noreply.github.com>
Date: Wed, 28 May 2025 09:43:19 -0700
Subject: [PATCH 1/2] complete livecode

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

diff --git a/src/Traversal.java b/src/Traversal.java
index 8da0f79..f24167b 100644
--- a/src/Traversal.java
+++ b/src/Traversal.java
@@ -1,5 +1,27 @@
 public class Traversal {
   public static void main(String[] args) {
+    TreeNode root = new TreeNode(10);
+    //System.out.println(root.data);
+
+    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);
+
+    preOrder(root);
+  }
+
+  public static void preOrder(TreeNode current){
+
+      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..c3857b5 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 c0071197d9716f6158efb4ee5022287fdb72bef9 Mon Sep 17 00:00:00 2001
From: Iquer_Dough <206500499+DennysSaenz123@users.noreply.github.com>
Date: Wed, 28 May 2025 11:45:35 -0700
Subject: [PATCH 2/2] Complete livecode

---
 src/Traversal.java | 26 +++++++++++++++++++++++++-
 1 file changed, 25 insertions(+), 1 deletion(-)

diff --git a/src/Traversal.java b/src/Traversal.java
index f24167b..9269366 100644
--- a/src/Traversal.java
+++ b/src/Traversal.java
@@ -13,7 +13,10 @@ public static void main(String[] args) {
     root.right.right = new TreeNode(5);
     root.right.right.right = new TreeNode(22);
 
-    preOrder(root);
+    // preOrder(root);
+    // System.out.println();
+    int result = sumOdd(root);
+    System.out.println(result);
   }
 
   public static void preOrder(TreeNode current){
@@ -24,4 +27,25 @@ public static void preOrder(TreeNode current){
       preOrder(current.right);
 
   }
+  public static int sumAll(TreeNode node){
+    if(node == null) return 0;
+    int total = node.data;
+    total += sumAll(node.left);
+    total += sumAll(node.right);
+    return total;
+  }
+
+  public static int sumOdd(TreeNode node){
+    if(node == null) return 0;
+    int total = 0;
+
+    if(node.data %2 != 0){
+      total += node.data;
+    }
+
+    total += sumOdd(node.left);
+    total += sumOdd(node.right);
+
+    return total;
+  }
 }