fantastic的博客

//二叉树节点 class Node { data = null left = null right = null constructor(key) { this.data = key; } } //树 class Tree { root = null count = null find(data) { let currentNode = this.root while (current.

全排列问题对三种遍历都涉及了

这里写自定义目录标题 // 节点对象 function Node( data, left, right, index) { this.data = data; // 节点值 this.left = left || null; // 当前节点的左子节点 this.right = right || null; // 当前节点的右子节点 this.index = index; this.leaf = false; i