完整可运行代码classTree{constructor(element){this.element=elementthis.left=nullthis.right=null}//中序遍历traversal(){log(this.element)if(this.left!==null){this.left.traversal()}if(this.right!==null){this.right.traversal()}}//反转二叉树reverse(){lettemp=this.leftthis.left=this.rightthis.right=tempif(this.left!==null){this.left.reverse()}if(this.right!==null){this.right.reverse()}}}//lett=newTree(0)letleft=newTree(1)letright=newTree(2)t.left=leftt.right=rightt.traversal()t.reverse()t.traversal()
