锐客网

  1. 首页 > 睿知 > it技术 > >

【数据结构】JavaScript Binary Tree 实现

javascript

完整可运行代码

class Tree { constructor(element) { this.element = element this.left = null this.right = null } //中序遍历 traversal() { console.log(this.element) if(this.left !== null) { this.left.traversal() } if(this.right !== null) { this.right.traversal() } } // 反转二叉树 reverse() { let temp = this.left this.left = this.right this.right = temp if(this.left !== null) { this.left.reverse() } if(this.right !== null) { this.right.reverse() } } }// let t = new Tree(0) let left = new Tree(1) let right = new Tree(2) t.left = left t.right = rightt.traversal() t.reverse() t.traversal()

    推荐阅读


    上一篇：golang metrics各个指标含义

    下一篇：【数据结构】JavaScript HashTable 实现