二叉树的递归
关注
分享
扫一扫
stefanharden
这个作者很懒，什么都没留下…
展开
-
Path Sum
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */cla原创 2014-01-20 16:19:20 · 339 阅读 · 0 评论 -
Path Sum II 路径和II
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */cla原创 2014-01-20 16:21:28 · 330 阅读 · 0 评论 -
Minimum Depth of Binary Tree 二叉树的最小深度
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */cla原创 2014-01-20 16:10:36 · 343 阅读 · 0 评论 -
Sum Root to Leaf Numbers 从根到叶子结点的和
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */cla原创 2014-01-20 16:38:49 · 397 阅读 · 0 评论 -
Maximum Depth of Binary Tree 二叉树的最大深度
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */cla原创 2014-01-20 16:14:35 · 464 阅读 · 0 评论 -
Binary Tree Maximum Path Sum 二叉树最大路径和
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */cla原创 2014-01-20 16:32:53 · 488 阅读 · 0 评论 -
Populating Next Right Pointers in Each Node 连接二叉树每一层的结点
/** * Definition for binary tree with next pointer. * struct TreeLinkNode { * int val; * TreeLinkNode *left, *right, *next; * TreeLinkNode(int x) : val(x), left(NULL), right(NULL), next(N原创 2014-01-20 16:36:55 · 369 阅读 · 0 评论