快捷導(dǎo)航

JAVA二叉樹的基本操作

更新時(shí)間：2021年08月26日 08:52:35 作者：JackHui007

這篇文章主要介紹了JAVA二叉樹的基本操作DEMO，想要詳情了解的小伙伴請(qǐng)接著看下文吧

記錄二叉樹的基本操作DEMO

1、創(chuàng)建一個(gè)二叉樹類

這里約束了泛型只能為實(shí)現(xiàn)了Comparable這個(gè)接口的類型。

/**
 * @author JackHui
 * @version BinaryTree.java, 2020年03月05日 12:45
 */
public class BinaryTree<T extends Comparable> {

    //樹根
    BinaryTreeNode root;

    public boolean deleteData(T data) {
        if (root.data.equals(data)) {
            root = null;
            return true;
        }
        return root.deleteNode(data);
    }

    public T frontSearch(T data) {
        return (T) root.frontSearch(data);
    }

    public T midSearch(T data) {
        return (T) root.midSearch(data);
    }

    public T rearSearch(T data) {
        return (T) root.rearSearch(data);
    }

    public void frontEach() {
        this.root.frontEach();
    }

    public void midEach() {
        this.root.midEach();
    }

    public void rearEach() {
        this.root.rearEach();
    }


    public BinaryTreeNode getRoot() {
        return root;
    }

    public void setRoot(BinaryTreeNode root) {
        this.root = root;
    }
}

2、然后創(chuàng)建二叉樹的節(jié)點(diǎn)

package binarytree;

/**
 * @author JackHui
 * @version BinaryTreeNode.java, 2020年03月06日 10:24
 */
public class BinaryTreeNode<T extends Comparable> {
    T data;
    BinaryTreeNode lChild;
    BinaryTreeNode rChild;

    public BinaryTreeNode(T data) {
        this.data = data;
    }

    //先序遍歷
    public void frontEach() {
        System.out.print(this.data + "\t");
        if (lChild != null) {
            lChild.frontEach();
        }
        if (rChild != null) {
            rChild.frontEach();
        }
    }

    //中序遍歷
    public void midEach() {
        if (lChild != null) {
            lChild.frontEach();
        }
        System.out.print(this.data + "\t");
        if (rChild != null) {
            rChild.frontEach();
        }
    }

    //后序遍歷
    public void rearEach() {
        if (lChild != null) {
            lChild.frontEach();
        }
        if (rChild != null) {
            rChild.frontEach();
        }
        System.out.print(this.data + "\t");
    }

    //先序查找
    public T frontSearch(T data) {
        T target = null;
        System.out.println("[先序遍歷]當(dāng)前遍歷到的元素:" + this.data + "\t查找的元素:" + data + "\t" + (this.data.compareTo(data) == 0 ? "查找到元素:" + data : ""));
        if (this.data.compareTo(data) == 0) {
            return data;
        } else {
            if (lChild != null && (target = (T) lChild.frontSearch(data)) != null) {
                return target;
            }
            if (rChild != null && (target = (T) rChild.frontSearch(data)) != null) {
                return target;
            }
        }
        return target;
    }

    //中序查找
    public T midSearch(T data) {
        T target = null;
        if (lChild != null && (target = (T) lChild.midSearch(data)) != null) {
            return target;
        }
        System.out.println("[中序遍歷]當(dāng)前遍歷到的元素:" + this.data + "\t查找的元素:" + data + "\t" + (this.data.compareTo(data) == 0 ? "查找到元素:" + data : ""));
        if (this.data.compareTo(data) == 0) {
            return data;
        } else {
            if (rChild != null && (target = (T) rChild.midSearch(data)) != null) {
                return target;
            }
        }
        return target;
    }

    //后序查找
    public T rearSearch(T data) {
        T target = null;
        if (lChild != null && (target = (T) lChild.rearSearch(data)) != null) {
            return target;
        }
        if (rChild != null && (target = (T) rChild.rearSearch(data)) != null) {
            return target;
        }
        System.out.println("[后續(xù)遍歷]當(dāng)前遍歷到的元素:" + this.data + "\t查找的元素:" + data + "\t" + (this.data.compareTo(data) == 0 ? "查找到元素:" + data : ""));
        if (this.data.compareTo(data) == 0) {
            return data;
        }
        return target;
    }

    //根據(jù)值刪除節(jié)點(diǎn)
    public boolean deleteNode(T data) {
        System.out.println("[節(jié)點(diǎn)刪除]當(dāng)前遍歷到的父節(jié)點(diǎn):" + this.data + "\t" + "匹配的節(jié)點(diǎn)數(shù)據(jù):" + data);
        //判斷左子樹是否匹配
        if (this.lChild != null && (this.lChild.data.compareTo(data) == 0)) {
            System.out.println("[節(jié)點(diǎn)刪除]當(dāng)前遍歷到的父節(jié)點(diǎn):" + this.data + "\t" + "匹配的節(jié)點(diǎn)數(shù)據(jù):" + data + "\t節(jié)點(diǎn)刪除成功!");
            this.lChild = null;
            return true;
        } else if (this.rChild != null && (this.rChild.data.compareTo(data) == 0)) {
            System.out.println("[節(jié)點(diǎn)刪除]當(dāng)前遍歷到的父節(jié)點(diǎn):" + this.data + "\t" + "匹配的節(jié)點(diǎn)數(shù)據(jù):" + data + "\t節(jié)點(diǎn)刪除成功!");
            this.rChild = null;
            return true;
        }
        if (this.lChild != null && this.lChild.deleteNode(data)) {
            return true;
        }
        if (this.rChild != null && this.rChild.deleteNode(data)) {
            return true;
        }
        return false;
    }

    public T getData() {
        return data;
    }

    public void setData(T data) {
        this.data = data;
    }

    public BinaryTreeNode getlChild() {
        return lChild;
    }

    public void setlChild(BinaryTreeNode lChild) {
        this.lChild = lChild;
    }

    public BinaryTreeNode getrChild() {
        return rChild;
    }

    public void setrChild(BinaryTreeNode rChild) {
        this.rChild = rChild;
    }
}

到此這篇關(guān)于JAVA二叉樹的基本操作DEMO的文章就介紹到這了,更多相關(guān)JAVA二叉樹內(nèi)容請(qǐng)搜索腳本之家以前的文章或繼續(xù)瀏覽下面的相關(guān)文章希望大家以后多多支持腳本之家！

您可能感興趣的文章: