complete livecode

src/Traversal.java

@@ -1,5 +1,45 @@
 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);
+    // System.out.println();
+    int result = sumOdd(root);
+    System.out.println(result);
   }
-}
+
+  public static void preOrder(TreeNode current){
+
+      if(current == null) return;
+      System.out.println(current.data);
+      preOrder(current.left);
+      preOrder(current.right);
+
+  }
+
+  public static void inOrder(TreeNode current){
+    if(current == null) return;
+    inOrder(current.left);
+    System.out.println(current.data);
+    inOrder(current.right);
+  }
+
+  public static void postOrder(TreeNode current){
+    if(current == null) return;
+    postOrder(current.left);
+    postOrder(current.right);
+    System.out.println(current.data);
+  }   
+
+

src/TreeNode.java

@@ -1,4 +1,15 @@
 public class TreeNode {
+    public int data;
+    public TreeNode left;
+    public TreeNode right;
 
-
+    public TreeNode(int data){
+        this.data = data;
+    }
+
+    public TreeNode(int data, TreeNode left, TreeNode right){
+        this.data = data;
+        this.left = left;
+        this.right = right;
+    }
 }