Veritas_des_Liberty

2018年11月24日

摘要： Design a class to find the kth largest element in a stream. Note that it is the kth largest element in the sorted order, not the kth distinct element. 阅读全文

posted @ 2018-11-24 22:11 Veritas_des_Liberty 阅读(299) 评论(0) 推荐(0)

Delete Node in a BST

摘要： Given a root node reference of a BST and a key, delete the node with the given key in the BST. Return the root node reference (possibly updated) of th 阅读全文

posted @ 2018-11-24 18:31 Veritas_des_Liberty 阅读(184) 评论(0) 推荐(0)

Insert into a Binary Search Tree

摘要： Given the root node of a binary search tree (BST) and a value to be inserted into the tree, insert the value into the BST. Return the root node of the 阅读全文

posted @ 2018-11-24 12:22 Veritas_des_Liberty 阅读(220) 评论(0) 推荐(0)

Search in a Binary Search Tree

摘要： Given the root node of a binary search tree (BST) and a value. You need to find the node in the BST that the node's value equals the given value. Retu 阅读全文

posted @ 2018-11-24 11:40 Veritas_des_Liberty 阅读(198) 评论(0) 推荐(0)

Binary Search Tree Iterator

摘要： 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 阅读(234) 评论(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 阅读(223) 评论(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 阅读(312) 评论(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 阅读(177) 评论(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 阅读(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)

Veritas des Liberty

公告