脚本宝典收集整理的这篇文章主要介绍了对一个有序数组,构造二叉排序树,脚本宝典觉得挺不错的,现在分享给大家,也给大家做个参考。
node['rightChild'] = make_sort_tree(arr.slice(mid + 1, len)); }; return node; } function serach_tree(node) { if(node) { var ret = [node['value']]; var leftList = serach_tree(node['leftChild']); var rightList = serach_tree(node['rightChild']); return leftList.concat(ret).concat(rightList); } else { return []; } } var root = make_sort_tree(list); console.log(root); var ret = serach_tree(root); console.log(ret);