Balanced Binary Tree Better Solution [LeetCode] https://leetcode.com/submissions/detail/40087813/ Total Accepted: 72203 Total Submissions: 225370 Difficulty: Easy Question Given a binary tree, determine if it is height-balanced. For this problem, a h…
Balanced Binary Tree Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1. Show Tags SOLU…
作者: 负雪明烛 id: fuxuemingzhu 个人博客:http://fuxuemingzhu.cn/ 目录 题目描述 题目大意 解题方法 递归 迭代 日期 题目地址:https://leetcode.com/problems/binary-tree-preorder-traversal/#/description 题目描述 Given a binary tree, return the preorder traversal of its nodes' values. For exampl…
作者: 负雪明烛 id: fuxuemingzhu 个人博客:http://fuxuemingzhu.cn/ 目录 题目描述 解题方法 递归 迭代 日期 题目地址:https://leetcode.com/problems/binary-tree-inorder-traversal/ 题目描述 Given a binary tree, return the inorder traversal of its nodes' values. For example: Given binary tree…
作者: 负雪明烛 id: fuxuemingzhu 个人博客:http://fuxuemingzhu.cn/ 目录 题目描述 题目大意 解题方法 统计字符串出现的次数 日期 题目地址:https://leetcode-cn.com/problems/construct-binary-tree-from-string/ 题目描述 You need to construct a binary tree from a string consisting of parenthesis and integ…
作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 目录 题目描述 题目大意 解题方法 递归 迭代 日期 题目地址:https://leetcode-cn.com/problems/binary-tree-upside-down/ 题目描述 Given a binary tree where all the right nodes are either leaf nodes with a sibling (a left node tha…
Binary Tree Postorder Traversal Given a binary tree, return the postorder traversal of its nodes' values. For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [3,2,1]. Note: Recursive solution is trivial, could you do it iteratively…
Binary Tree Inorder Traversal Given a binary tree, return the inorder traversal of its nodes' values. For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [1,3,2]. Note: Recursive solution is trivial, could you do it iteratively? co…
Binary Tree Preorder Traversal Given a binary tree, return the preorder traversal of its nodes' values. For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [1,2,3]. Note: Recursive solution is trivial, could you do it iteratively?…
