对一个有序数组，组织二叉排序树

2019年8月31日 152次阅读 来源: 炑木 
<!-- index.html -->
<html>
<head>
  <meta charset="utf-8">
</head>
<body>
  <script type="text/javascript">


      var list = [1, 2, 3, 4, 5, 6, 7, 8];

      function make_sort_tree(arr) {
          var len = arr.length,
              mid = parseInt(len / 2),
              node = {
                  value: arr[mid]
              };
        if(mid > 0) { node['leftChild'] = make_sort_tree(arr.slice(0, mid)); }
        if(len > 2) { 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);


  </script>
</body>
</html>
    原文作者：炑木
    原文地址: https://segmentfault.com/a/1190000008470196
    本文转自网络文章，转载此文章仅为分享知识，如有侵权，请联系博主进行删除。
点赞