![\"\"](\"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2025\/05\/20250519170425-682b649935131.png\")
<\/p>\n\u8fd9\u90e8\u5206\u4e3b\u8981\u662f\u7528\u4ee3\u7801\u5b9e\u73b0\u6709\u5e8f\u4e8c\u53c9\u6811\u3001\u6811\u904d\u5386\u3001\u5220\u9664\u8282\u70b9<\/p>\n
\u76ee\u5f55<\/p>\n
\n
1.\u6784\u5efa\u6709\u5e8f\u4e8c\u53c9\u6811<\/p>\n
1.1\u539f\u7406<\/p>\n
\u00a01.2\u63d2\u5165\u5b9e\u73b0<\/p>\n
2.\u5e7f\u5ea6\u4f18\u5148\u904d\u5386–\u961f\u5217\u5b9e\u73b0<\/p>\n
3.\u6df1\u5ea6\u4f18\u5148\u904d\u5386–\u9012\u5f52\u5b9e\u73b0<\/p>\n
3.1\u5148\u5e8f\u904d\u5386<\/p>\n
3.2\u4e2d\u5e8f\u904d\u5386<\/p>\n
3.3\u540e\u5e8f\u904d\u5386<\/p>\n
4.\u5220\u9664<\/p>\n
4.1\u5220\u9664\u53f6\u5b50\u8282\u70b9<\/p>\n
4.2\u5220\u9664\u6709\u4e00\u68f5\u5b50\u6811\u7684\u8282\u70b9<\/p>\n
4.3\u5220\u9664\u6709\u4e24\u68f5\u5b50\u6811\u7684\u8282\u70b9<\/p>\n
5.\u6574\u4f53\u4ee3\u7801<\/p>\n
\u5de6\u8fb9\u8282\u70b9\u503c\u5c0f\u4e8e\u7236\u8282\u70b9，\u53f3\u8fb9\u8282\u70b9\u503c\u5927\u4e8e\u7236\u8282\u70b9，\u770b\u4e0b\u56fe<\/p>\n
<\/p>\n
\u5f53\u4f20\u5165value\u503c\u65f6，\u5224\u65adroot\u8282\u70b9\u662f\u5426\u4e3a\u7a7a：\u7a7a\u7684\u8bdd\u5efa\u7acb\u65b0\u8282\u70b9\u505aroot；\u4e0d\u7a7a，\u5efa\u7acb\u4e00\u4e2a\u4e2d\u95f4\u8282\u70b9index，\u7136\u540e\u5faa\u73af\u6309\u7167\u63d2\u5165\u539f\u7406\u5224\u65ad\u63d2\u5230\u54ea，\u4ee3\u7801\u5982\u4e0b：<\/p>\n
public void insert(int value){
\n Node node = new Node(value);
\n if(root==null){
\n root = node;
\n return;
\n }
\n Node index = root;
\n while(true) {
\n if(index.value>value) {
\n \/\/\u8981\u63d2\u5165\u7684\u8282\u70b9\u503c\u5c0f
\n if(index.left==null) {
\n \/\/\u63d2\u5165
\n index.left=node;
\n return;
\n }
\n index=index.left;
\n }else{
\n \/\/\u8981\u63d2\u5165\u7684\u8282\u70b9\u503c\u5927
\n if(index.right==null){
\n index.right=node;
\n return;
\n }
\n index=index.right;
\n }
\n } <\/p>\n
\u5e7f\u5ea6\u4f18\u5148\u904d\u5386\u5c31\u662f\u5c42\u6b21\u904d\u5386，\u4f7f\u7528\u961f\u5217\u5b9e\u73b0\u3002\u5f53\u961f\u5217\u4e2d\u8fdb\u5165\u4e00\u4e2a\u65b0\u8282\u70b9，\u8f93\u51fa\u540e\u5c31\u627e\u8fd9\u4e2a\u8282\u70b9\u7684\u5de6\u53f3\u5b69\u5b50\u5165\u961f\u3002<\/p>\n
\u4ee3\u7801\u5982\u4e0b：<\/p>\n
public void levelOrder() {
\n Queue<Node> queue = new LinkedList<Node>();
\n if(root!=null) {
\n queue.add(root);
\n }
\n Node index;
\n while (!queue.isEmpty()){
\n index = queue.poll();
\n System.out.print(index.value+Messages.getString("BinaryTree.0")); \/\/$NON-NLS-1$
\n if(index.left!=null){
\n queue.add(index.left);
\n }
\n if(index.right!=null) {
\n queue.add(index.right);
\n }
\n }
\n System.out.println();
\n } <\/p>\n
\u5c31\u662f\u6839-\u5de6-\u53f3\u7684\u987a\u5e8f，\u4f7f\u7528\u9012\u5f52\u5b9e\u73b0，\u4ee3\u7801\u5982\u4e0b：<\/p>\n
\/*
\n * \u5148\u5e8f\u904d\u5386
\n *\/
\n public void beforeOrder(Node node){
\n if(node==null) {
\n return;
\n }
\n System.out.print(node.value+Messages.getString("BinaryTree.1"));
\n beforeOrder(node.left);
\n beforeOrder(node.right);
\n } <\/p>\n
\u4f7f\u7528\u5de6-\u6839-\u53f3\u987a\u5e8f<\/p>\n
\/*
\n * \u4e2d\u5e8f\u904d\u5386
\n *\/
\n public void inOrder(Node node){
\n if(node==null){
\n return;
\n }
\n inOrder(node.left);
\n System.out.print(node.value+Messages.getString("BinaryTree.2")); \/\/$NON-NLS-1$
\n inOrder(node.right);
\n } <\/p>\n
\u4f7f\u7528\u5de6-\u53f3-\u6839\u987a\u5e8f，\u4ee3\u7801\u5982\u4e0b：<\/p>\n
\/*
\n * \u540e\u5e8f\u904d\u5386
\n *\/
\n public void afterOrder(Node node) {
\n if(node==null) {
\n return;
\n }
\n afterOrder(node.left);
\n afterOrder(node.right);
\n System.out.print(node.value+Messages.getString("BinaryTree.3"));
\n } <\/p>\n
\u5220\u9664\u6bd4\u8f83\u590d\u6742，\u8981\u5206\u4e09\u79cd\u60c5\u51b5：<\/p>\n
\u9700\u8981\u989d\u5916\u5199\u4e00\u4e2a\u51fd\u6570\u6765\u5bfb\u627e\u7236\u8282\u70b9，\u4ee3\u7801\u5982\u4e0b：<\/p>\n
\/**
\n * \u627e\u76ee\u6807\u503c\u7684\u7236\u8282\u70b9
\n *\/
\npublic Node searchParent(int value) {
\nif(root==null) {
\nreturn null;
\n}
\nNode index = root;
\nwhile (index!=null) {
\nif((index.left!=null&&index.left.value==value)||(index.right!=null&&index.right.value==value)) {
\nreturn index;
\n}else if (index.value>value) {
\nindex=index.left;
\n}else {
\nindex = index.right;
\n}<\/p>\n
}
\nreturn null;
\n} <\/p>\n
\u8fd9\u90e8\u5206\u4ee3\u7801\u5982\u4e0b：<\/p>\n
if(target.left==null&&target.right==null) {
\n\/\/\u53f6\u5b50\u8282\u70b9
\n\/\/\u6ca1\u6709\u7236\u8282\u70b9
\nif(parent==null) {
\nroot=null;
\nreturn;
\n}
\n\/\/\u6709\u7236\u8282\u70b9
\nif(parent.left!=null&&parent.left.value==value) {
\nparent.left=null;
\n}else {
\nparent.right=null;
\n}<\/p>\n
} <\/p>\n
\u4ee3\u7801\u5982\u4e0b：<\/p>\n
\/\/\u6709\u4e00\u68f5\u5b50\u6811\u7684\u8282\u70b9
\n\/\/\u6ca1\u6709\u7236\u8282\u70b9
\nif(parent==null) {
\n\/\/\u76ee\u6807\u8282\u70b9\u6709\u5de6\u5b50\u6811\u8fd8\u662f\u53f3\u5b50\u6811
\nif(target.left!=null) {
\nroot = root.left;
\n}else {
\nroot=root.right;
\n}
\nreturn;
\n}
\n\/\/\u6709\u7236\u8282\u70b9
\n\/\/\u5224\u65ad\u76ee\u6807\u8282\u70b9\u662f\u7236\u8282\u70b9\u7684\u5de6\u5b69\u5b50\u8fd8\u662f\u53f3\u5b69\u5b50
\nif(parent.left!=null&&parent.left.value==value) {
\n\/\/\u5de6\u5b69\u5b50
\n\/\/\u76ee\u6807\u8282\u70b9\u6709\u5de6\u5b50\u6811\u8fd8\u662f\u53f3\u5b50\u6811
\nif(target.left!=null) {
\nparent.left = target.left;
\n}else {
\nparent.left = target.right;
\n}<\/p>\n
}else {
\n\/\/\u53f3\u5b69\u5b50
\n\/\/\u76ee\u6807\u8282\u70b9\u6709\u5de6\u5b50\u6811\u8fd8\u662f\u53f3\u5b50\u6811
\nif(target.left!=null) {
\nparent.right = target.left;
\n}else {
\nparent.right = target.right;
\n}
\n} <\/p>\n
\u9700\u8981\u989d\u5916\u5199\u4e00\u4e2a\u5224\u65ad\u6700\u5c0f\u503c\u7684\u51fd\u6570：<\/p>\n
\/**
\n * \u627e\u6811\u5f53\u4e2d\u7684\u6700\u5c0f\u503c
\n *\/
\npublic int min(Node node) {
\nNode index = node;
\nwhile(index.left!=null) {
\nindex=index.left;
\n}
\nreturn index.value;
\n} <\/p>\n
\u00a0<\/p>\n
\u4ee3\u7801\u5982\u4e0b：<\/p>\n
if(target.left!=null&&target.right!=null) {
\n\/\/\u6709\u4e24\u68f5\u5b50\u6811\u7684\u8282\u70b9
\nint minVal = min(target.right);
\ndelete(minVal);
\ntarget.value = minVal;<\/p>\n
} <\/p>\n
\u4ee3\u7801\u5982\u4e0b：<\/p>\n
package com.qcby.\u6811;<\/p>\n
import java.util.LinkedList;
\nimport java.util.Queue;<\/p>\n
public class BinaryTree {
\n Node root;
\n \/**
\n * \u63d2\u5165
\n *\/
\n public void insert(int value){
\n Node node = new Node(value);
\n if(root==null){
\n root = node;
\n return;
\n }
\n Node index = root;
\n while(true) {
\n if(index.value>value) {
\n \/\/\u8981\u63d2\u5165\u7684\u8282\u70b9\u503c\u5c0f
\n if(index.left==null) {
\n \/\/\u63d2\u5165
\n index.left=node;
\n return;
\n }
\n index=index.left;
\n }else{
\n \/\/\u8981\u63d2\u5165\u7684\u8282\u70b9\u503c\u5927
\n if(index.right==null){
\n index.right=node;
\n return;
\n }
\n index=index.right;
\n }
\n }
\n }
\n \/*
\n * \u5e7f\u5ea6\u4f18\u5148\u904d\u5386
\n *\/
\n public void levelOrder() {
\n Queue<Node> queue = new LinkedList<Node>();
\n if(root!=null) {
\n queue.add(root);
\n }
\n Node index;
\n while (!queue.isEmpty()){
\n index = queue.poll();
\n System.out.print(index.value+Messages.getString("BinaryTree.0")); \/\/$NON-NLS-1$
\n if(index.left!=null){
\n queue.add(index.left);
\n }
\n if(index.right!=null) {
\n queue.add(index.right);
\n }
\n }
\n System.out.println();
\n }
\n \/*
\n * \u5148\u5e8f\u904d\u5386
\n *\/
\n public void beforeOrder(Node node){
\n if(node==null) {
\n return;
\n }
\n System.out.print(node.value+Messages.getString("BinaryTree.1")); \/\/$NON-NLS-1$
\n beforeOrder(node.left);
\n beforeOrder(node.right);
\n }
\n \/*
\n * \u4e2d\u5e8f\u904d\u5386
\n *\/
\n public void inOrder(Node node){
\n if(node==null){
\n return;
\n }
\n inOrder(node.left);
\n System.out.print(node.value+Messages.getString("BinaryTree.2")); \/\/$NON-NLS-1$
\n inOrder(node.right);
\n }
\n \/*
\n * \u540e\u5e8f\u904d\u5386
\n *\/
\n public void afterOrder(Node node) {
\n if(node==null) {
\n return;
\n }
\n afterOrder(node.left);
\n afterOrder(node.right);
\n System.out.print(node.value+Messages.getString("BinaryTree.3")); \/\/$NON-NLS-1$
\n }
\n \/*
\n * \u67e5\u627e
\n *\/
\n public Node search(int value) {
\n if(root==null) {
\n return null;
\n }
\n Node index = root;
\n while (index!=null) {
\n if(index.value==value){
\n return index;
\n }else if(index.value>value) {
\n index = index.left;
\n }else {
\n index=index.right;
\n }
\n }
\n return null;
\n }
\n \/**
\n * \u627e\u76ee\u6807\u503c\u7684\u7236\u8282\u70b9
\n *\/
\npublic Node searchParent(int value) {
\nif(root==null) {
\nreturn null;
\n}
\nNode index = root;
\nwhile (index!=null) {
\nif((index.left!=null&&index.left.value==value)||(index.right!=null&&index.right.value==value)) {
\nreturn index;
\n}else if (index.value>value) {
\nindex=index.left;
\n}else {
\nindex = index.right;
\n}<\/p>\n
}
\nreturn null;
\n}<\/p>\n
\/**
\n * \u627e\u6811\u5f53\u4e2d\u7684\u6700\u5c0f\u503c
\n *\/
\npublic int min(Node node) {
\nNode index = node;
\nwhile(index.left!=null) {
\nindex=index.left;
\n}
\nreturn index.value;
\n}<\/p>\n
\/**
\n * \u5220\u9664
\n *\/
\npublic void delete(int value){
\nif(root==null) {
\nSystem.out.println(Messages.getString("BinaryTree.4"));
\nreturn;
\n}
\n\/\/\u627e\u76ee\u6807\u8282\u70b9
\nNode target = search(value);
\nif(target==null) {
\nSystem.out.println(Messages.getString("BinaryTree.5"));
\nreturn;
\n}
\n\/\/\u627e\u76ee\u6807\u8282\u70b9\u7684\u7236\u8282\u70b9
\nNode parent = searchParent(value);<\/p>\n
\/\/\u4e09\u79cd\u60c5\u51b5，\u5206\u60c5\u51b5\u8ba8\u8bba
\nif(target.left==null&&target.right==null) {
\n\/\/\u53f6\u5b50\u8282\u70b9
\n\/\/\u6ca1\u6709\u7236\u8282\u70b9
\nif(parent==null) {
\nroot=null;
\nreturn;
\n}
\n\/\/\u6709\u7236\u8282\u70b9
\nif(parent.left!=null&&parent.left.value==value) {
\nparent.left=null;
\n}else {
\nparent.right=null;
\n}<\/p>\n
}else if(target.left!=null&&target.right!=null) {
\n\/\/\u6709\u4e24\u68f5\u5b50\u6811\u7684\u8282\u70b9
\nint minVal = min(target.right);
\ndelete(minVal);
\ntarget.value = minVal;<\/p>\n
}else {
\n\/\/\u6709\u4e00\u68f5\u5b50\u6811\u7684\u8282\u70b9
\n\/\/\u6ca1\u6709\u7236\u8282\u70b9
\nif(parent==null) {
\n\/\/\u76ee\u6807\u8282\u70b9\u6709\u5de6\u5b50\u6811\u8fd8\u662f\u53f3\u5b50\u6811
\nif(target.left!=null) {
\nroot = root.left;
\n}else {
\nroot=root.right;
\n}
\nreturn;
\n}
\n\/\/\u6709\u7236\u8282\u70b9
\n\/\/\u5224\u65ad\u76ee\u6807\u8282\u70b9\u662f\u7236\u8282\u70b9\u7684\u5de6\u5b69\u5b50\u8fd8\u662f\u53f3\u5b69\u5b50
\nif(parent.left!=null&&parent.left.value==value) {
\n\/\/\u5de6\u5b69\u5b50
\n\/\/\u76ee\u6807\u8282\u70b9\u6709\u5de6\u5b50\u6811\u8fd8\u662f\u53f3\u5b50\u6811
\nif(target.left!=null) {
\nparent.left = target.left;
\n}else {
\nparent.left = target.right;
\n}<\/p>\n
}else {
\n\/\/\u53f3\u5b69\u5b50
\n\/\/\u76ee\u6807\u8282\u70b9\u6709\u5de6\u5b50\u6811\u8fd8\u662f\u53f3\u5b50\u6811
\nif(target.left!=null) {
\nparent.right = target.left;
\n}else {
\nparent.right = target.right;
\n}
\n}
\n}
\n}
\n@Override
\npublic String toString() {
\nreturn "BinaryTree [root=" + root + "]";
\n}<\/p>\n
} <\/p>\n
\u00a0<\/p><\/p>\n","protected":false},"excerpt":{"rendered":"
\u6587\u7ae0\u6d4f\u89c8\u9605\u8bfb973\u6b21\uff0c\u70b9\u8d5e17\u6b21\uff0c\u6536\u85cf15\u6b21\u3002\u5f53\u4f20\u5165value\u503c\u65f6\uff0c\u5224\u65adroot\u8282\u70b9\u662f\u5426\u4e3a\u7a7a\uff1a\u7a7a\u7684\u8bdd\u5efa\u7acb\u65b0\u8282\u70b9\u505aroot\uff1b\u5e7f\u5ea6\u4f18\u5148\u904d\u5386\u5c31\u662f\u5c42\u6b21\u904d\u5386\uff0c\u4f7f\u7528\u961f\u5217\u5b9e\u73b0\u3002\u5f53\u961f\u5217\u4e2d\u8fdb\u5165\u4e00\u4e2a\u65b0\u8282\u70b9\uff0c\u8f93\u51fa\u540e\u5c31\u627e\u8fd9\u4e2a\u8282\u70b9\u7684\u5de6\u53f3\u5b69\u5b50\u5165\u961f\u30021.1\u539f\u7406\uff1a\u5de6\u8fb9\u8282\u70b9\u503c\u5c0f\u4e8e\u7236\u8282\u70b9\uff0c\u53f3\u8fb9\u8282\u70b9\u503c\u5927\u4e8e\u7236\u8282\u70b9\uff0c\u770b\u4e0b\u56fe\u3002\u8fd9\u90e8\u5206\u4e3b\u8981\u662f\u7528\u4ee3\u7801\u5b9e\u73b0\u4e8c\u53c9\u6811\u53ca\u6709\u5e8f\u4e8c\u53c9\u6811\u30022.\u5e7f\u5ea6\u4f18\u5148\u904d\u5386–\u961f\u5217\u5b9e\u73b0\u30023.\u6df1\u5ea6\u4f18\u5148\u904d\u5386–\u9012\u5f52\u5b9e\u73b0\u3002<\/p>\n","protected":false},"author":2,"featured_media":38218,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[99,3332,371,1813],"topic":[],"class_list":{"0":"post-38219","1":"post","2":"type-post","3":"status-publish","4":"format-standard","5":"has-post-thumbnail","6":"hentry","7":"category-server","8":"tag-java","10":"tag-371","11":"tag-1813"},"yoast_head":"\n