用JS中ES6的CLASS创建排序二叉树

1. 根据插入的数据最终应展示的结果

具体代码

class treeNode {
    value: any;
    left: treeNode | null;
    right: treeNode | null;
    constructor(value: any) {
        this.value = value;
        this.left = null;
        this.right = null;
    }
}

class tree {
    treeHead: treeNode | null;
    constructor() {
        this.treeHead = null;
    }
    insert(node: treeNode) {
        if (this.treeHead == null) {
            this.treeHead = node;
            return;
        }
        let parent: treeNode = this.treeHead;
        while (true) {
            //有序插入
            if (parent.value <= node.value) {
                //判断该插入数据是否小于根节点, 否就往右插
                if (parent.right == null) {
                    parent.right = node;
                    break;
                }
                parent = parent.right;
            }

            if (parent.value > node.value) {
                //判断该插入数据是否小于根节点, 是就往左插
                if (parent.left == null) {
                    parent.left = node;
                    break;
                }
                parent = parent.left;
            }
        }
    }
    qianxu() {
        let parent: treeNode | null = this.treeHead;
        let arr: any[] = [];
        function digui(parent: treeNode) {
            arr.push(parent.value);
            //根在前，直接插入
            if (parent.left) {
                digui(parent.left);
            }
            if (parent.right) {
                digui(parent.right);
            }
        }
        if (!parent) {
            return [];
        }
        digui(parent);
        return arr;
    }
    zhongxu() {
        // 可以按序遍历二叉树
        let parent: treeNode | null = this.treeHead;
        let arr: any[] = [];
        function digui(parent: treeNode) {
            if (parent.left) {
                digui(parent.left);
            }
            arr.push(parent.value);
            //左在前，查完左，插入
            if (parent.right) {
                digui(parent.right);
            }
        }
        if (!parent) {
            return [];
        }
        digui(parent);
        return arr;
    }
    houxu() {
        let parent: treeNode | null = this.treeHead;
        let arr: any[] = [];
        function digui(parent: treeNode) {
            if (parent.left) {
                digui(parent.left);
            }
            if (parent.right) {
                digui(parent.right);
            }
            //左右在前, 查完左右再插入
            arr.push(parent.value);
        }
        if (!parent) {
            return [];
        }
        digui(parent);
        return arr;
    }
}

let tree1 = new tree();
tree1.insert(new treeNode(5));
tree1.insert(new treeNode(8));
tree1.insert(new treeNode(7));
tree1.insert(new treeNode(2));
tree1.insert(new treeNode(383));
tree1.insert(new treeNode(684));
tree1.insert(new treeNode(1));
tree1.insert(new treeNode(28));
tree1.insert(new treeNode(4));
tree1.insert(new treeNode(3));

console.log('tree1: ', tree1.treeHead);
console.log('tree1: ', tree1.qianxu()); //中序
//[ 5, 2, 1, 4, 3, 8, 7, 383, 28, 684 ]
console.log('tree1: ', tree1.zhongxu());
//[ 1, 2, 3, 4, 5, 7, 8, 28, 383, 684 ]
console.log('tree1: ', tree1.houxu());
//[ 1, 3, 4, 2, 7, 28, 684, 383, 8, 5 ]