二叉树遍历

<template>
  <div>{{ data }}</div>
</template>

<script setup lang="ts">
import { ref } from "vue";
const data = ref<any>([]);
const tree: any = {
  value: 1,
  left: {
    value: 7,
    left: {
      value: 3,
    },
    right: {
      value: 5,
      left: {
        value: 9,
      },
    },
  },
  right: {
    value: 3,
    right: {
      value: 8,
    },
  },
};
//先序优先查找  使用递归查找
const findTree = (tree: any, result: any = []) => {
  if (tree) {
    result.push(tree.value);
    findTree(tree.left, result);
    findTree(tree.right, result);
  }
  return result;
};
// data.value=findTree(tree, []);

//广度优先查找  使用while将二叉树的每一项推入栈中，然后使用shift将栈中的元素取出来
const findTree2 = (tree: any, result: any = []) => {
  if (tree) {
    const queue = [tree];
    while (queue.length) {
      const item = queue.shift();//取出第一个并把第一个删除
      result.push(item.value);
      if (item.left) queue.push(item.left);
      if (item.right) queue.push(item.right);
    }
  }
  return result;
};
data.value = findTree2(tree, []);
</script>

<style scoped></style>