zoukankan      html  css  js  c++  java
  • [LeetCode] 872. Leaf-Similar Trees

    Consider all the leaves of a binary tree.  From left to right order, the values of those leaves form a leaf value sequence.

    For example, in the given tree above, the leaf value sequence is (6, 7, 4, 9, 8).

    Two binary trees are considered leaf-similar if their leaf value sequence is the same.

    Return true if and only if the two given trees with head nodes root1 and root2 are leaf-similar.

    Note:

    • Both of the given trees will have between 1 and 100 nodes.
     
    The straightforward solution is to use DFS to get both the leaf sequence first then compare them. An even better solution is to compare one leaf node at a time, providing the possiblity of early traverse termination.  To return leaf node value one at a time and keep track unvisited leaf nodes, we use a stack. Since stack is LIFO and we need to visit left leaf nodes first, we push a node's right child into the stack first, then left child. 
     
    /**
     * Definition for a binary tree node.
     * public class TreeNode {
     *     int val;
     *     TreeNode left;
     *     TreeNode right;
     *     TreeNode(int x) { val = x; }
     * }
     */
    class Solution {
        public boolean leafSimilar(TreeNode root1, TreeNode root2) {
            Stack<TreeNode> s1 = new Stack<>();
            Stack<TreeNode> s2 = new Stack<>();
            
            s1.push(root1); s2.push(root2);
            while(!s1.isEmpty() && !s2.isEmpty()) {
                if(dfs(s1) != dfs(s2)) {
                    return false;
                }
            }
            return s1.isEmpty() && s2.isEmpty();
        }
        private int dfs(Stack<TreeNode> stack) {
            while(true) {
                TreeNode node = stack.pop();
                if(node.right != null) stack.push(node.right);
                if(node.left != null) stack.push(node.left);
                if(node.left == null && node.right == null) return node.val;            
            }
        }
    }
     
    Related Topics
    How to traverse a binary tree in pre-order, in-order and post-order iteratively?(not using recursion)
     
  • 相关阅读:
    【理财启蒙】理财:需要树立正确的金钱观
    【系统设计】分布式唯一ID生成方案总结
    【Hash一致性算法】什么是Hash一致性算法
    【位图算法】什么是BitMap
    关于枚举类你可能不知道的事
    【数据结构】什么是AVL树
    mysql5.6 主从同步配置
    vmstat命令详解
    pstack跟踪进程栈
    iostat 磁盘io分析工具
  • 原文地址:https://www.cnblogs.com/lz87/p/10372300.html
Copyright © 2011-2022 走看看