这篇博客介绍了如何使用Java实现二叉树的数据结构，并通过自定义的TreeView类进行可视化展示。包括了二叉树的插入、搜索、删除等操作，以及中序、前序、后序遍历。在Test类中，展示了如何在GUI界面中动态展示二叉树的增删改查操作。
BinaryTree.java
package com.binarytree.test;
import java.util.*;
public class BinaryTree>{
private TreeNode root;
private int size=0;
public BinaryTree() {
}
public BinaryTree(E[] objects) {
for (int i = 0; i < objects.length; i++) {
insert(objects[i]);
}
｝
public boolean search(E e) {
// TODO Auto-generated method stub
TreeNode current=root;
while (current!=null) {
if (e.compareTo(current.element)<0) {
current=current.left;
}else if (e.compareTo(current.element)>0) {
current=current.right;
}else
return true;
}
return false;
}
public boolean insert(E e) {
// TODO Auto-generated method stub
if (root==null) {
root=creatTreeNode(e);
}else {
TreeNode parent=null;
TreeNode current = root;
while (current!=null) {
if (e.compareTo(current.element)<0) {
parent=current;
current=current.left;
} else if(e.compareTo(current.element)>0){
parent=current;
current=current.right;
}else
return false;
}
if (e.compareTo(parent.element)<0) {
parent.left=creatTreeNode(e);
}
if (e.compareTo(parent.element)>0) {
parent.right=creatTreeNode(e);
}
}
size++;
return true;
}
public TreeNode creatTreeNode(E e) {
return new TreeNode(e);
}
public void inorder() {
inorder(root);
}
public void inorder(TreeNode root) {
if (root==null) return;
inorder(root.left);
System.out.print(root.element+" ");
inorder(root.right);
}
public void postorder() {
postorder(root);
}
public void po
最低0.47元/天 解锁文章
548
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
