介绍这里相同意味着结构和值都处于相同的位置。为了实现这一点,我们需要使用 dfs 算法,这样它也会检查深度。 使用 bfs 算法无法实现这一点。所以这里我使用有序遍历来得到结果class Node { constructor(data) { this.left = null; this.right = null; this.data = data; }}let root1, root2;// left root rightconst checkIdentical = (binaryTree1, binaryTree2) => { let tree = ''; const helper = (root) => { if (root == null) { return tree; } helper(root.left); tree += root.data; helper(root.right); return tree; }; const tree1 = helper(binaryTree1); tree = ''; const tree2 = helper(binaryTree2); if (tree1 === tree2) { console.log('Both are identical'); } else { console.log('Not Identical'); }}root1 = new Node(1);root1.left = new Node(2);root1.right = new Node(3);root1.left.left = new Node(4);root1.left.right = new Node(5);root2 = new Node(1);root2.left = new Node(2);root2.right = new Node(3);root2.left.left = new Node(4);root2.left.right = new Node(5);checkIdentical(root1, root2);/*Both are identical*/登录后复制有任何问题请随时联系我立即学习“Java免费学习笔记(深入)”; 以上就是如何使用 Javascript 确定二叉树是否相同的详细内容,更多请关注我的其它相关文章!
标签:Node,right,相同,Javascript,二叉树,new,root2,root1,left From: https://www.cnblogs.com/aow054/p/18424916