Title: leetcode110:平衡二叉树 · Issue #44 · sisterAn/JavaScript-Algorithms · GitHub
Open Graph Title: leetcode110:平衡二叉树 · Issue #44 · sisterAn/JavaScript-Algorithms
X Title: leetcode110:平衡二叉树 · Issue #44 · sisterAn/JavaScript-Algorithms
Description: 给定一个二叉树,判断它是否是高度平衡的二叉树。 本题中,一棵高度平衡二叉树定义为: 一个二叉树每个节点 的左右两个子树的高度差的绝对值不超过1。 示例 1: 给定二叉树 [3,9,20,null,null,15,7] 3 / \ 9 20 / \ 15 7 返回 true 。 示例 2: 给定二叉树 [1,2,2,3,3,null,null,4,4] 1 / \ 2 2 / \ 3 3 / \ 4 4 返回 false 。 附赠leetcode地址:leetcode
Open Graph Description: 给定一个二叉树,判断它是否是高度平衡的二叉树。 本题中,一棵高度平衡二叉树定义为: 一个二叉树每个节点 的左右两个子树的高度差的绝对值不超过1。 示例 1: 给定二叉树 [3,9,20,null,null,15,7] 3 / \ 9 20 / \ 15 7 返回 true 。 示例 2: 给定二叉树 [1,2,2,3,3,null,null,4,4] 1 / \ 2 2 / \ 3 3 / ...
X Description: 给定一个二叉树,判断它是否是高度平衡的二叉树。 本题中,一棵高度平衡二叉树定义为: 一个二叉树每个节点 的左右两个子树的高度差的绝对值不超过1。 示例 1: 给定二叉树 [3,9,20,null,null,15,7] 3 / \ 9 20 / \ 15 7 返回 true 。 示例 2: 给定二叉树 [1,2,2,3,3,null,null,4,4] 1 / \ 2 2 / \ 3 3 / ...
Opengraph URL: https://github.com/sisterAn/JavaScript-Algorithms/issues/44
X: @github
Domain: github.com
{"@context":"https://schema.org","@type":"DiscussionForumPosting","headline":"leetcode110:平衡二叉树","articleBody":"给定一个二叉树,判断它是否是高度平衡的二叉树。\r\n\r\n本题中,一棵高度平衡二叉树定义为:\r\n\r\n\u003e 一个二叉树每个节点 的左右两个子树的高度差的绝对值不超过1。\r\n\r\n**示例 1:**\r\n\r\n给定二叉树 `[3,9,20,null,null,15,7]`\r\n\r\n 3\r\n / \\\r\n 9 20\r\n / \\\r\n 15 7\r\n返回 `true` 。\r\n\r\n**示例 2:**\r\n\r\n给定二叉树 `[1,2,2,3,3,null,null,4,4]`\r\n\r\n 1\r\n / \\\r\n 2 2\r\n / \\\r\n 3 3\r\n / \\\r\n 4 4\r\n返回 `false` 。\r\n\r\n附赠leetcode地址:[leetcode](https://leetcode-cn.com/problems/binary-tree-inorder-traversal/solution/javascriptjie-zhong-xu-bian-li-er-cha-shu-by-user7/)","author":{"url":"https://github.com/sisterAn","@type":"Person","name":"sisterAn"},"datePublished":"2020-05-18T15:59:22.000Z","interactionStatistic":{"@type":"InteractionCounter","interactionType":"https://schema.org/CommentAction","userInteractionCount":5},"url":"https://github.com/44/JavaScript-Algorithms/issues/44"}
| route-pattern | /_view_fragments/issues/show/:user_id/:repository/:id/issue_layout(.:format) |
| route-controller | voltron_issues_fragments |
| route-action | issue_layout |
| fetch-nonce | v2:6df69258-0741-05a4-334c-997a52e195c8 |
| current-catalog-service-hash | 81bb79d38c15960b92d99bca9288a9108c7a47b18f2423d0f6438c5b7bcd2114 |
| request-id | A8FE:992B3:E1A830:13B8D2D:696A689D |
| html-safe-nonce | 75b478a98d761b6fd3300878cdb98f41ce1d1d7f44e5447646a0363ed768a830 |
| visitor-payload | eyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiJBOEZFOjk5MkIzOkUxQTgzMDoxM0I4RDJEOjY5NkE2ODlEIiwidmlzaXRvcl9pZCI6IjU3Nzc0NjkyNzY4MTcwOTA3MTciLCJyZWdpb25fZWRnZSI6ImlhZCIsInJlZ2lvbl9yZW5kZXIiOiJpYWQifQ== |
| visitor-hmac | a05038e9b368e3939edffe2ece3b1c288f5bc55acc4218b75c1dede692f63eaa |
| hovercard-subject-tag | issue:620325906 |
| github-keyboard-shortcuts | repository,issues,copilot |
| google-site-verification | Apib7-x98H0j5cPqHWwSMm6dNU4GmODRoqxLiDzdx9I |
| octolytics-url | https://collector.github.com/github/collect |
| analytics-location | / |
| fb:app_id | 1401488693436528 |
| apple-itunes-app | app-id=1477376905, app-argument=https://github.com/_view_fragments/issues/show/sisterAn/JavaScript-Algorithms/44/issue_layout |
| twitter:image | https://opengraph.githubassets.com/143fc2fec5887f080ed99d89d71f9162c32d83952a3eb62c36961af1fda0d940/sisterAn/JavaScript-Algorithms/issues/44 |
| twitter:card | summary_large_image |
| og:image | https://opengraph.githubassets.com/143fc2fec5887f080ed99d89d71f9162c32d83952a3eb62c36961af1fda0d940/sisterAn/JavaScript-Algorithms/issues/44 |
| og:image:alt | 给定一个二叉树,判断它是否是高度平衡的二叉树。 本题中,一棵高度平衡二叉树定义为: 一个二叉树每个节点 的左右两个子树的高度差的绝对值不超过1。 示例 1: 给定二叉树 [3,9,20,null,null,15,7] 3 / \ 9 20 / \ 15 7 返回 true 。 示例 2: 给定二叉树 [1,2,2,3,3,null,null,4,4] 1 / \ 2 2 / \ 3 3 / ... |
| og:image:width | 1200 |
| og:image:height | 600 |
| og:site_name | GitHub |
| og:type | object |
| og:author:username | sisterAn |
| hostname | github.com |
| expected-hostname | github.com |
| None | 6fea32d5b7276b841b7a803796d9715bc6cfb31ed549fdf9de2948ac25d12ba6 |
| turbo-cache-control | no-preview |
| go-import | github.com/sisterAn/JavaScript-Algorithms git https://github.com/sisterAn/JavaScript-Algorithms.git |
| octolytics-dimension-user_id | 19721451 |
| octolytics-dimension-user_login | sisterAn |
| octolytics-dimension-repository_id | 252061924 |
| octolytics-dimension-repository_nwo | sisterAn/JavaScript-Algorithms |
| octolytics-dimension-repository_public | true |
| octolytics-dimension-repository_is_fork | false |
| octolytics-dimension-repository_network_root_id | 252061924 |
| octolytics-dimension-repository_network_root_nwo | sisterAn/JavaScript-Algorithms |
| turbo-body-classes | logged-out env-production page-responsive |
| disable-turbo | false |
| browser-stats-url | https://api.github.com/_private/browser/stats |
| browser-errors-url | https://api.github.com/_private/browser/errors |
| release | f2d9f6432a5a115ec709295ae70623f33bb80aee |
| ui-target | full |
| theme-color | #1e2327 |
| color-scheme | light dark |
Links:
Viewport: width=device-width