llllmz

导航

2024年3月5日

112. 路径总和c

摘要: /** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */ bool judge(struct T 阅读全文

posted @ 2024-03-05 22:18 神奇的萝卜丝 阅读(10) 评论(0) 推荐(0)

513. 找树左下角的值c

摘要: 用的层序遍历 /** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */ int findBott 阅读全文

posted @ 2024-03-05 22:01 神奇的萝卜丝 阅读(11) 评论(0) 推荐(0)

404. 左叶子之和c

摘要: /** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */ void postorder(stru 阅读全文

posted @ 2024-03-05 21:38 神奇的萝卜丝 阅读(11) 评论(0) 推荐(0)

257. 二叉树的所有路径c

摘要: 很好的题目,让我的sprintf旋转 /** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */ 阅读全文

posted @ 2024-03-05 20:34 神奇的萝卜丝 阅读(21) 评论(0) 推荐(0)

110. 平衡二叉树c

摘要: /** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */ int max(int i,int j 阅读全文

posted @ 2024-03-05 17:29 神奇的萝卜丝 阅读(14) 评论(0) 推荐(0)

222. 完全二叉树的节点个数c

摘要: /** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */ int countNodes(stru 阅读全文

posted @ 2024-03-05 16:40 神奇的萝卜丝 阅读(15) 评论(0) 推荐(0)

111. 二叉树的最小深度c

摘要: /** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */ int min(int i,int j 阅读全文

posted @ 2024-03-05 16:37 神奇的萝卜丝 阅读(12) 评论(0) 推荐(0)

559. N 叉树的最大深度c

摘要: /** * Definition for a Node. * struct Node { * int val; * int numChildren; * struct Node** children; * }; */ int maxDepth(struct Node* root) { if(!roo 阅读全文

posted @ 2024-03-05 16:29 神奇的萝卜丝 阅读(12) 评论(0) 推荐(0)

104. 二叉树的最大深度c

摘要: /** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */ int max(int i,int j 阅读全文

posted @ 2024-03-05 15:59 神奇的萝卜丝 阅读(15) 评论(0) 推荐(0)

572. 另一棵树的子树c

摘要: /** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */ bool issameroot(str 阅读全文

posted @ 2024-03-05 15:53 神奇的萝卜丝 阅读(15) 评论(0) 推荐(0)

100. 相同的树c

摘要: /** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */ bool isSameTree(str 阅读全文

posted @ 2024-03-05 15:35 神奇的萝卜丝 阅读(12) 评论(0) 推荐(0)

101. 对称二叉树c

摘要: /** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */ bool judge(struct T 阅读全文

posted @ 2024-03-05 15:31 神奇的萝卜丝 阅读(8) 评论(0) 推荐(0)

226. 翻转二叉树 c

摘要: 层次遍历的题目C写吐血了,缓一缓再写那种气死人的题目。 /** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; 阅读全文

posted @ 2024-03-05 15:08 神奇的萝卜丝 阅读(11) 评论(0) 推荐(0)