摘要：
You are given the root of a binary tree containing digits from 0 to 9 only. Each root-to-leaf path in the tree represents a number. For example, the r
阅读全文
posted @ 2025-03-26 22:17
ZhangZhihuiAAA
阅读(9)
推荐(0)
摘要：
Given the root of a binary tree and an integer targetSum, return true if the tree has a root-to-leaf path such that adding up all the values along the
阅读全文
posted @ 2025-03-26 17:48
ZhangZhihuiAAA
阅读(9)
推荐(0)
摘要：
Given the root of a binary tree, flatten the tree into a "linked list": The "linked list" should use the same TreeNode class where the right child poi
阅读全文
posted @ 2025-03-26 12:12
ZhangZhihuiAAA
阅读(9)
推荐(0)
摘要：
Given a binary tree struct Node { int val; Node *left; Node *right; Node *next; } Populate each next pointer to point to its next right node. If there
阅读全文
posted @ 2025-03-26 11:34
ZhangZhihuiAAA
阅读(8)
推荐(0)
摘要：
Given two integer arrays inorder and postorder where inorder is the inorder traversal of a binary tree and postorder is the postorder traversal of the
阅读全文
posted @ 2025-03-26 09:09
ZhangZhihuiAAA
阅读(10)
推荐(0)
浙公网安备 33010602011771号
浙ICP备2021040463号-3
