fatttcat

2019年1月1日

889. Construct Binary Tree from Preorder and Postorder Traversal - Medium

摘要： Return any binary tree that matches the given preorder and postorder traversals. Values in the traversals pre and post are distinct positive integers. 阅读全文

posted @ 2019-01-01 05:20 fatttcat 阅读(127) 评论(0) 推荐(0)

106. Construct Binary Tree from Inorder and Postorder Traversal - Medium

摘要： 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 @ 2019-01-01 04:23 fatttcat 阅读(109) 评论(0) 推荐(0)

2018年12月31日

105. Construct Binary Tree from Preorder and Inorder Traversal - Medium

摘要： 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-12-31 19:23 fatttcat 阅读(108) 评论(0) 推荐(0)

449. Serialize and Deserialize BST - Medium

摘要： 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-12-31 15:44 fatttcat 阅读(122) 评论(0) 推荐(0)

114. Flatten Binary Tree to Linked List - Medium

摘要： Given a binary tree, flatten it to a linked list in-place. For example, given the following tree: The flattened tree should look like: 每个节点的右节点都是preor 阅读全文

posted @ 2018-12-31 15:01 fatttcat 阅读(94) 评论(0) 推荐(0)

199. Binary Tree Right Side View - Medium

摘要： Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom. Example 阅读全文

posted @ 2018-12-31 12:06 fatttcat 阅读(109) 评论(0) 推荐(0)

173. Binary Search Tree Iterator - Medium

摘要： 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-12-31 11:39 fatttcat 阅读(105) 评论(0) 推荐(0)

98. Validate Binary Search Tree - Medium

摘要： 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-12-31 09:37 fatttcat 阅读(141) 评论(0) 推荐(0)

965. Univalued Binary Tree - Easy

摘要： A binary tree is univalued if every node in the tree has the same value. Return true if and only if the given tree is univalued. Example 1: Example 2: 阅读全文

posted @ 2018-12-31 08:08 fatttcat 阅读(151) 评论(0) 推荐(0)

589. N-ary Tree Preorder Traversal - Easy

摘要： Given an n-ary tree, return the preorder traversal of its nodes' values. For example, given a 3-ary tree: Return its preorder traversal as: [1,3,5,6,2 阅读全文

posted @ 2018-12-31 08:01 fatttcat 阅读(117) 评论(0) 推荐(0)

公告