From d9355923ec7757236c376e2fd38ffa40f55c2ea4 Mon Sep 17 00:00:00 2001
From: liangjinglin <liangjinglin@hc-smart.com>
Date: Tue, 21 Jan 2025 13:17:19 +0800
Subject: [PATCH] =?UTF-8?q?2025-01-20=20=E5=AE=8C=E5=85=A8=E4=BA=8C?=
 =?UTF-8?q?=E5=8F=89=E6=A0=91=E6=8E=92=E5=BA=8F?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../java/tree/CompleteBinaryTree.java         | 53 +++++++++++++++++++
 1 file changed, 53 insertions(+)
 create mode 100644 src/dataANDcalc/java/tree/CompleteBinaryTree.java

diff --git a/src/dataANDcalc/java/tree/CompleteBinaryTree.java b/src/dataANDcalc/java/tree/CompleteBinaryTree.java
new file mode 100644
index 0000000..7a2e0cc
--- /dev/null
+++ b/src/dataANDcalc/java/tree/CompleteBinaryTree.java
@@ -0,0 +1,53 @@
+package tree;
+
+public class CompleteBinaryTree {
+
+    private int[] arr;
+
+    public CompleteBinaryTree(int[] arr) {
+        this.arr = arr;
+    }
+
+    private void fowardSortArr(int index){
+        if(arr.length == 0){
+            System.out.println("数组为空");
+        }
+
+        System.out.println("当前节点为:"+index+", 数据:"+arr[index]);
+        if (index * 2 + 1 < arr.length){
+            fowardSortArr(index * 2 + 1);
+        }
+        if (index * 2 + 2 < arr.length){
+            fowardSortArr(index * 2 + 2);
+        }
+    }
+
+    public static void main(String[] args) {
+        CompleteBinaryTree completeBinaryTree = new CompleteBinaryTree(new int[]{1,2,3,4,5,6,7});
+        completeBinaryTree.fowardSortArr(0);
+    }
+
+    public static class TreeNode{
+        private int node;
+
+        private int data;
+
+        private TreeNode left;
+
+        private TreeNode right;
+
+        public TreeNode(int node) {
+            this.node = node;
+        }
+
+        @Override
+        public String toString() {
+            return "TreeNode{" +
+                    "node=" + node +
+                    "data=" + data +
+                    ", left=" + (left == null ? "null" : left.node) +
+                    ", right=" + (right == null ? "null" : right.node) +
+                    '}';
+        }
+    }
+}