day22-24 二叉树

最新推荐文章于 2024-05-19 17:24:39 发布

RealRecall

最新推荐文章于 2024-05-19 17:24:39 发布

阅读量77

点赞数

分类专栏：初学前端开发

本文链接：https://blog.csdn.net/RealRecall/article/details/111143419

版权

初学前端开发专栏收录该内容

46 篇文章 1 订阅

订阅专栏

放一个二叉树的例子

<html>
  <body>
    <script>
      var tree = {
        id: 0,
        name: "root",
        left: {
          id: 1,
          name: "Simon",
          left: {
            id: 3,
            name: "Carl",
            left: {
              id: 7,
              name: "Lee",
              left: {
                id: 11,
                name: "Fate",
              },
            },
            right: {
              id: 8,
              name: "Annie",
              left: {
                id: 12,
                name: "Saber",
              },
            },
          },
          right: {
            id: 4,
            name: "Tony",
            left: {
              id: 9,
              name: "Candy",
            },
          },
        },
        right: {
          id: 2,
          name: "right",
          left: {
            id: 5,
            name: "Carl",
          },
          right: {
            id: 6,
            name: "Carl",
            right: {
              id: 10,
              name: "Kai",
            },
          },
        },
      };

      // 假设id和name均不会重复，根据输入name找到对应的id
      function findIdByName(name) {
        var id;
        function node(tree) {
          if (tree) {
            if (tree.name == name) {
              id = tree.id;
            }
            node(tree.left);
            node(tree.right);
          }
        }
        node(tree);
        return id;
      }
      console.log(findIdByName("Annie"));

      // 假设id和name均不会重复，根据输入id找到对应的name
      function findNameById(id) {
        var name;
        function node(tree) {
          if (tree) {
            if (tree.id == id) {
              name = tree.name;
            }
            node(tree.left);
            node(tree.right);
          }
        }
        node(tree);
        return name;
      }
      console.log(findNameById("8"));

      // 把这个对象中所有的名字以“前序遍历”的方式全部输出到console中
      var dlr = [];
      function getListWithDLR() {
        function node(tree) {
          if (tree) {
            dlr.push(tree.name);
            node(tree.left);
            node(tree.right);
          }
        }
        node(tree);
        console.log(dlr);
      }
      getListWithDLR();

      // 把这个对象中所有的名字以“中序遍历”的方式全部输出到console中
      var ldr = [];
      function getListWithLDR() {
        function node(tree) {
          if (tree) {
            node(tree.left);
            ldr.push(tree.name);
            node(tree.right);
          }
        }
        node(tree);
        console.log(ldr);
      }
      getListWithLDR();

      // 把这个对象中所有的名字以“后序遍历”的方式全部输出到console中
      var lrd = [];
      function getListWithLRD() {
        function node(tree) {
          if (tree) {
            node(tree.left);
            node(tree.right);
            lrd.push(tree.name);
          }
        }
        node(tree);
        console.log(lrd);
      }
      getListWithLRD();
    </script>
  </body>
</html>

RealRecall

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
day22-24 二叉树

放一个二叉树的例子<html> <body> <script> var tree = { id: 0, name: "root", left: { id: 1, name: "Simon", left: { id: 3, name: "Carl", left: {
复制链接

扫一扫