2016年5月11日

Populating Next Right Pointers in Each Node II

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

posted @ 2016-05-11 21:47 Sheryl Wang 阅读(150) 评论(0) 推荐(0) 编辑

Populating Next Right Pointers in Each Node

摘要： Given a binary tree Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to NULL 阅读全文

posted @ 2016-05-11 17:18 Sheryl Wang 阅读(127) 评论(0) 推荐(0) 编辑

导航