From 0500c16fe4a911b4e14f4d20c10d3a948e048728 Mon Sep 17 00:00:00 2001 From: Omnissiah <234093135+Zeta1313@users.noreply.github.com> Date: Thu, 12 Feb 2026 14:49:04 -0800 Subject: [PATCH 1/4] 2/12 class --- src/Traversal.java | 31 +++++++++++++++++++++++++++++++ src/TreeNode.java | 8 ++++++++ 2 files changed, 39 insertions(+) diff --git a/src/Traversal.java b/src/Traversal.java index 8da0f79..2a9f8dd 100644 --- a/src/Traversal.java +++ b/src/Traversal.java @@ -1,5 +1,36 @@ public class Traversal { public static void main(String[] args) { + TreeNode root = new TreeNode(10, null, null); + root.left = new TreeNode(9, null, null); + root.left.left = new TreeNode(5, null, null); + root.left.right = new TreeNode(2, null, null); + root.right = new TreeNode(15, null, null); + root.right.left = new TreeNode(-3, null, null); + root.right.right = new TreeNode(5, null, null); + root.right.right.right = new TreeNode(22, null, null); + preOrder(root); + System.out.println("-------------"); + postOrder(root); + System.out.println("-------------"); + inOrder(root); + } + public static void preOrder(TreeNode node){ + if (node == null) return; + System.out.println(node.value); + preOrder(node.left); + preOrder(node.right); + } + public static void postOrder(TreeNode node){ + if (node == null) return; + postOrder(node.left); + postOrder(node.right); + System.out.println(node.value); + } + public static void inOrder(TreeNode node){ + if (node == null) return; + inOrder(node.left); + System.out.println(node.value); + inOrder(node.right); } } diff --git a/src/TreeNode.java b/src/TreeNode.java index acd9639..23cc827 100644 --- a/src/TreeNode.java +++ b/src/TreeNode.java @@ -1,4 +1,12 @@ public class TreeNode { + public int value; + public TreeNode left; + public TreeNode right; + public TreeNode (int value, TreeNode left, TreeNode right) { + this.value = value; + this.left = left; + this.right = right; + } } \ No newline at end of file From 734cd8027fdd24c8f48db8b3c1db944c02785725 Mon Sep 17 00:00:00 2001 From: Omnissiah <234093135+Zeta1313@users.noreply.github.com> Date: Tue, 17 Feb 2026 14:36:40 -0800 Subject: [PATCH 2/4] 2/17 class --- src/Traversal.java | 56 +++++++++++++++++++++++++++++++++------------- src/TreeNode.java | 10 ++++----- 2 files changed, 45 insertions(+), 21 deletions(-) diff --git a/src/Traversal.java b/src/Traversal.java index 2a9f8dd..cd94491 100644 --- a/src/Traversal.java +++ b/src/Traversal.java @@ -1,36 +1,60 @@ public class Traversal { public static void main(String[] args) { - TreeNode root = new TreeNode(10, null, null); - root.left = new TreeNode(9, null, null); - root.left.left = new TreeNode(5, null, null); - root.left.right = new TreeNode(2, null, null); - root.right = new TreeNode(15, null, null); - root.right.left = new TreeNode(-3, null, null); - root.right.right = new TreeNode(5, null, null); - root.right.right.right = new TreeNode(22, null, null); + TreeNode Stringroot = new TreeNode("lol", null, null); + Stringroot.left = new TreeNode("Laugh", null, null); + Stringroot.right = new TreeNode("Chuckle", null, null); + + TreeNode root = new TreeNode(10, null, null); + root.left = new TreeNode(9, null, null); + root.left.left = new TreeNode(5, null, null); + root.left.right = new TreeNode(2, null, null); + root.right = new TreeNode(15, null, null); + root.right.left = new TreeNode(-3, null, null); + root.right.right = new TreeNode(5, null, null); + root.right.right.right = new TreeNode(22, null, null); preOrder(root); - System.out.println("-------------"); + System.out.println(); postOrder(root); - System.out.println("-------------"); + System.out.println(); inOrder(root); + System.out.println(); + inOrder(Stringroot); + System.out.println(); + preOrderGreater(root); + System.out.println(); + System.out.println(countNodes(root)); + System.out.print(countNodes(Stringroot)); } - public static void preOrder(TreeNode node){ + public static void preOrder(TreeNode node){ if (node == null) return; - System.out.println(node.value); + System.out.print(node.value); preOrder(node.left); preOrder(node.right); } - public static void postOrder(TreeNode node){ + public static void postOrder(TreeNode node){ if (node == null) return; postOrder(node.left); postOrder(node.right); - System.out.println(node.value); + System.out.print(node.value + " "); } - public static void inOrder(TreeNode node){ + public static void inOrder(TreeNode node){ if (node == null) return; inOrder(node.left); - System.out.println(node.value); + System.out.print(node.value + " "); inOrder(node.right); } + public static void preOrderGreater(TreeNode node){ + if (node == null) return; + if (node.value > 7) { + System.out.print(node.value + " "); + } + preOrderGreater(node.left); + preOrderGreater(node.right); + } + public static int countNodes(TreeNode node) { + if (node == null) return 0; + if (node.right == null && node.left == null) return 1; + return countNodes(node.right) + countNodes(node.left) + 1; + } } diff --git a/src/TreeNode.java b/src/TreeNode.java index 23cc827..c61c840 100644 --- a/src/TreeNode.java +++ b/src/TreeNode.java @@ -1,9 +1,9 @@ -public class TreeNode { - public int value; - public TreeNode left; - public TreeNode right; +public class TreeNode { + public T value; + public TreeNode left; + public TreeNode right; - public TreeNode (int value, TreeNode left, TreeNode right) { + public TreeNode (T value, TreeNode left, TreeNode right) { this.value = value; this.left = left; this.right = right; From a19192bedb171e8b54d478fcf51f953ba8bdbff3 Mon Sep 17 00:00:00 2001 From: Omnissiah <234093135+Zeta1313@users.noreply.github.com> Date: Thu, 19 Feb 2026 14:30:58 -0800 Subject: [PATCH 3/4] 2/19 class: --- src/Traversal.java | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) diff --git a/src/Traversal.java b/src/Traversal.java index cd94491..6d4d3a1 100644 --- a/src/Traversal.java +++ b/src/Traversal.java @@ -1,3 +1,6 @@ +import java.util.HashMap; +import java.util.Map; + public class Traversal { public static void main(String[] args) { TreeNode Stringroot = new TreeNode("lol", null, null); @@ -25,6 +28,7 @@ public static void main(String[] args) { System.out.println(); System.out.println(countNodes(root)); System.out.print(countNodes(Stringroot)); + System.out.print(toMap(root)); } public static void preOrder(TreeNode node){ if (node == null) return; @@ -57,4 +61,18 @@ public static int countNodes(TreeNode node) { if (node.right == null && node.left == null) return 1; return countNodes(node.right) + countNodes(node.left) + 1; } + + public static Map toMap(TreeNode node) { + Map counts = new HashMap<>(); + toMap(node, counts); + return counts; + } + + private static void toMap(TreeNode node, Map counts) { + if (node == null) return; + counts.put(node.value, counts.getOrDefault(node.value, 0)+1); + toMap(node.left, counts); + toMap(node.right, counts); + return; + } } From e9c8cb6bee425b7ae12024bd27539a4a084672f7 Mon Sep 17 00:00:00 2001 From: Omnissiah <234093135+Zeta1313@users.noreply.github.com> Date: Tue, 24 Feb 2026 15:38:24 -0800 Subject: [PATCH 4/4] 2/24 class --- src/Traversal.java | 63 ++++++++++++++++++++++++++++++++++++---------- 1 file changed, 50 insertions(+), 13 deletions(-) diff --git a/src/Traversal.java b/src/Traversal.java index 6d4d3a1..9ad29e6 100644 --- a/src/Traversal.java +++ b/src/Traversal.java @@ -1,5 +1,8 @@ import java.util.HashMap; import java.util.Map; +import java.util.LinkedList; +import java.util.Queue; +import java.util.Stack; public class Traversal { public static void main(String[] args) { @@ -16,19 +19,29 @@ public static void main(String[] args) { root.right.right = new TreeNode(5, null, null); root.right.right.right = new TreeNode(22, null, null); - preOrder(root); - System.out.println(); - postOrder(root); - System.out.println(); - inOrder(root); - System.out.println(); - inOrder(Stringroot); - System.out.println(); - preOrderGreater(root); - System.out.println(); - System.out.println(countNodes(root)); - System.out.print(countNodes(Stringroot)); - System.out.print(toMap(root)); + TreeNode Megaroot = new TreeNode(1, null , null); + TreeNode current = Megaroot; + + for (int i=0; i < 500000; i++) { + current.right = new TreeNode(1, null, null); + current = current.right; + } + + //preOrder(root); + //System.out.println(); + //postOrder(root); + //System.out.println(); + //inOrder(root); + //System.out.println(); + //inOrder(Stringroot); + //System.out.println(); + //preOrderGreater(root); + //System.out.println(); + //System.out.println(countNodes(root)); + //System.out.print(countNodes(Stringroot)); + //System.out.print(toMap(root)); + //preOrderIter(Megaroot); + LevelOrder(Megaroot); } public static void preOrder(TreeNode node){ if (node == null) return; @@ -42,6 +55,30 @@ public static void postOrder(TreeNode node){ postOrder(node.right); System.out.print(node.value + " "); } + public static void preOrderIter(TreeNode node){ + if (node == null) return; + Stack> stack = new Stack<>(); + stack.push(node); + while(!stack.isEmpty()) { + TreeNode current = stack.pop(); + if (current==null) continue; + System.out.print(current.value); + stack.push(current.right); + stack.push(current.left); + } + } + public static void LevelOrder(TreeNode node){ + if (node == null) return; + Queue> stack = new LinkedList<>(); + stack.add(node); + while(!stack.isEmpty()) { + TreeNode current = stack.poll(); + if (current==null) continue; + System.out.print(current.value); + stack.add(current.left); + stack.add(current.right); + } + } public static void inOrder(TreeNode node){ if (node == null) return; inOrder(node.left);