2018年11月22日
Populating Next Right Pointers in Each Node II
摘要： 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 @ 2018-11-22 22:40 Veritas_des_Liberty 阅读(255) 评论(0) 推荐(0)
Populating Next Right Pointers in Each Node
摘要： Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; } Populate each next pointer to point to its ne 阅读全文
posted @ 2018-11-22 22:28 Veritas_des_Liberty 阅读(271) 评论(0) 推荐(0)
Construct Binary Tree from Preorder and Inorder Traversal
摘要： Given preorder and inorder traversal of a tree, construct the binary tree. Note:You may assume that duplicates do not exist in the tree. For example, 阅读全文
posted @ 2018-11-22 19:08 Veritas_des_Liberty 阅读(183) 评论(0) 推荐(0)
Construct Binary Tree from Inorder and Postorder Traversal
摘要： Given inorder and postorder traversal of a tree, construct the binary tree. Note:You may assume that duplicates do not exist in the tree. For example, 阅读全文
posted @ 2018-11-22 18:04 Veritas_des_Liberty 阅读(206) 评论(0) 推荐(0)