js二叉树

最新推荐文章于 2025-04-15 11:38:22 发布

weixin_33809981

最新推荐文章于 2025-04-15 11:38:22 发布

阅读量309

点赞数 1

CC 4.0 BY-SA版权

文章标签：数据结构与算法

原文链接：http://www.cnblogs.com/CoderZX/p/10493239.html

本文详细介绍了二叉搜索树的数据结构实现，包括节点的插入、查询节点个数、展示节点树、查找特定值等功能。通过具体代码示例，深入解析了二叉搜索树的构造过程及其基本操作。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

插入数值
//初始化node对象
function Node ( data) {
    this.data = data;
    this.left = null;
    this.right = null;
}
// 定义插入对象
function BST () {
    this.root = null;
    this.size = size;
    this.count = 0;
    this.insert = insert;
    this.show = show;
}
//查询节点个数
function size () {
    return this.count;
}
// 展示节点树
function show () {
    return this.root;
}
function insert (data) {
    var n = new Node(data, null, null);
    if (this.root == null) {
        //如果不存在节点，则此节点是根节点
        this.root = n;
        this.count++;
    } else {
        var current = this.root;
        var parent;
        while(current) {
            parent = current;
            if(data < current.data){
                current = current.left;
                if(current == null) {
                    parent.left = n;
                    this.count++;
                    break;
                }
            } else if (data > current.data){
                current = current.right;
                if(current == null) {
                    parent.right = n;
                    this.count++;
                    break;
                }
            } else {
                current.data == data;
                break;
            }
        }
    }
}
插入键值对

//初始化node对象
function Node (key ,value) {
    this.key = key;
    this.value = value;
    this.left = null;
    this.right = null;
}
// 定义插入对象
function BST () {
    this.root = null;
    this.size = size;
    this.count = 0;
    this.insert = insert;
    this.show = show;
    this.contain = contain;
　　　this.search = search;
}
//查询节点个数
function size () {
    return this.count;
}
// 展示节点树
function show () {
    return this.root;
}
//插入
function insert (key, value) {
    var n = new Node(key, value);
    if (this.root == null) {
        //如果不存在节点，则此节点是根节点
        this.count++;
        return this.root = n;
    } else {
        var current = this.root;
        var parent;
        while(current) {
            parent = current;
            if(key < current.key){
                current = current.left;
                if(current == null) {
                    parent.left = n;
                    this.count++;
                    break;
                }
            } else if (key > current.key){
                current = current.right;
                if(current == null) {
                    parent.right = n;
                    this.count++;
                    break;
                }
            } else {
                current = n;
                break;
            }
        }
    }
}
//查找是否含有这个值
function contain (key) {
    if(!this.root){
        return false;
    }
    var current = this.root;
    while (current){
        if (key == current.key) {
            return true;
        } else if (key > current.key){
            current = current.right;
        } else  {
            current = current.left;
        }
    }
}
//查找

function search (key) {
    if(!this.root){
        return null;
    }
    var current = this.root;
    while (current){
        if (key == current.key) {
            return current;
        } else if (key > current.key){
            current = current.right;
        } else  {
            current = current.left;
        }
    }
}