vercont

摘要： Given a binary treestruct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next;}Populate each next pointer to... 阅读全文

posted @ 2018-09-23 00:41 vercont 阅读(102) 评论(0) 推荐(0)

摘要： Given a binary treestruct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next;}Populate each next pointer to... 阅读全文

posted @ 2018-09-23 00:41 vercont 阅读(89) 评论(0) 推荐(0)

摘要： Follow up for problem "Populating Next Right Pointers in Each Node".What if the given tree could be any binary tree? Would your previo... 阅读全文

posted @ 2018-09-23 00:41 vercont 阅读(102) 评论(0) 推荐(0)

摘要： Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals ... 阅读全文

posted @ 2018-09-23 00:41 vercont 阅读(117) 评论(0) 推荐(0)

摘要： Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals ... 阅读全文

posted @ 2018-09-23 00:41 vercont 阅读(123) 评论(0) 推荐(0)

摘要： Given a 2D board containing'X'and'O', capture all regions surrounded by'X'.A region is captured by flipping all'O's into'X's in that s... 阅读全文

posted @ 2018-09-23 00:41 vercont 阅读(127) 评论(0) 推荐(0)

摘要： Given a 2D board containing'X'and'O', capture all regions surrounded by'X'.A region is captured by flipping all'O's into'X's in that s... 阅读全文

posted @ 2018-09-23 00:41 vercont 阅读(101) 评论(0) 推荐(0)

摘要： Follow up for problem "Populating Next Right Pointers in Each Node".What if the given tree could be any binary tree? Would your previo... 阅读全文

posted @ 2018-09-23 00:41 vercont 阅读(127) 评论(0) 推荐(0)

摘要： Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.For example: Given the below bin... 阅读全文

posted @ 2018-09-23 00:40 vercont 阅读(100) 评论(0) 推荐(0)

摘要： Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.For example: Given the below bin... 阅读全文

posted @ 2018-09-23 00:40 vercont 阅读(134) 评论(0) 推荐(0)