Veritas_des_Liberty

2018年11月24日

摘要： Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST. Calling next() will return the n 阅读全文

posted @ 2018-11-24 10:51 Veritas_des_Liberty 阅读(226) 评论(0) 推荐(0) 编辑

Validate Binary Search Tree

摘要： Given a binary tree, determine if it is a valid binary search tree (BST). Assume a BST is defined as follows: The left subtree of a node contains only 阅读全文

posted @ 2018-11-24 09:58 Veritas_des_Liberty 阅读(219) 评论(0) 推荐(0) 编辑

2018年11月23日

Serialize and Deserialize Binary Tree

摘要： Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or 阅读全文

posted @ 2018-11-23 20:45 Veritas_des_Liberty 阅读(305) 评论(0) 推荐(0) 编辑

Lowest Common Ancestor of a Binary Tree

摘要： Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree. According to the definition of LCA on Wikipedia: “The lowes 阅读全文

posted @ 2018-11-23 15:50 Veritas_des_Liberty 阅读(172) 评论(0) 推荐(0) 编辑

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 阅读(247) 评论(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 阅读(262) 评论(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 阅读(174) 评论(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 阅读(195) 评论(0) 推荐(0) 编辑

2018年11月21日

Path Sum

摘要： 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 the given sum. N 阅读全文

posted @ 2018-11-21 22:09 Veritas_des_Liberty 阅读(200) 评论(0) 推荐(0) 编辑

Symmetric Tree

摘要： Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree [1,2,2,3,4,4,3] is symmet 阅读全文

posted @ 2018-11-21 18:33 Veritas_des_Liberty 阅读(188) 评论(0) 推荐(0) 编辑

Veritas des Liberty

公告