Leetcode - 随笔分类(第14页) - amazingzoe

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.Callingnext()will return the next... 阅读全文

posted @ 2015-08-03 12:09 amazingzoe 阅读(107) 评论(0) 推荐(0)

Count Complete Tree Nodes***

摘要：Given acompletebinary tree, count the number of nodes.Definition of a complete binary tree fromWikipedia:In a complete binary tree every level, except... 阅读全文

posted @ 2015-08-03 11:12 amazingzoe 阅读(146) 评论(0) 推荐(0)

Kth Smallest Element in a BST

摘要：Given a binary search tree, write a functionkthSmallestto find thekth smallest element in it.Note:You may assume k is always valid, 1 ≤ k ≤ BST's tota... 阅读全文

posted @ 2015-08-03 10:07 amazingzoe 阅读(167) 评论(0) 推荐(0)

Lowest Common Ancestor of a Binary Search Tree

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

posted @ 2015-08-03 09:52 amazingzoe 阅读(143) 评论(0) 推荐(0)

Lowest Common Ancestor****

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

posted @ 2015-08-03 00:05 amazingzoe 阅读(203) 评论(0) 推荐(0)

Binary Tree Right Side View

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

posted @ 2015-08-02 23:06 amazingzoe 阅读(154) 评论(0) 推荐(0)

Invert Binary Tree

摘要：Invert a binary tree. 4 / \ 2 7 / \ / \1 3 6 9to 4 / \ 7 2 / \ / \9 6 3 1Trivia:This problem was inspired bythis... 阅读全文

posted @ 2015-08-02 22:55 amazingzoe 阅读(145) 评论(0) 推荐(0)

Valid Anagram

摘要：Given two stringssandt, write a function to determine iftis an anagram ofs.For example,s= "anagram",t= "nagaram", return true.s= "rat",t= "car", retur... 阅读全文

posted @ 2015-08-02 21:58 amazingzoe 阅读(113) 评论(0) 推荐(0)

Sum Root to Leaf Numbers

摘要：Given a binary tree containing digits from0-9only, each root-to-leaf path could represent a number.An example is the root-to-leaf path1->2->3which rep... 阅读全文

posted @ 2015-08-02 21:35 amazingzoe 阅读(114) 评论(0) 推荐(0)

Binary Tree Maximum Path Sum

摘要：Given a binary tree, find the maximum path sum.The path may start and end at any node in the tree.For example:Given the below binary tree, 1 ... 阅读全文

posted @ 2015-08-02 21:27 amazingzoe 阅读(127) 评论(0) 推荐(0)

Path Sum II

摘要：Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.For example:Given the below binary tree andsum =... 阅读全文

posted @ 2015-08-01 23:06 amazingzoe 阅读(150) 评论(0) 推荐(0)

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.Fo... 阅读全文

posted @ 2015-07-31 17:18 amazingzoe 阅读(124) 评论(0) 推荐(0)

Maximum Depth of Binary Tree

摘要：Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest le... 阅读全文

posted @ 2015-07-31 15:58 amazingzoe 阅读(129) 评论(0) 推荐(0)

Minimum Depth of Binary Tree

摘要：Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest le... 阅读全文

posted @ 2015-07-31 15:40 amazingzoe 阅读(146) 评论(0) 推荐(0)

Convert Sorted List to Binary Search Tree

摘要：Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.Analyse: the core idea of this problem is... 阅读全文

posted @ 2015-07-31 11:44 amazingzoe 阅读(174) 评论(0) 推荐(0)

Convert Sorted Array to Binary Search Tree

摘要：Given an array where elements are sorted in ascending order, convert it to a height balanced BST.Analyse: Using binary search to divide the sorted arr... 阅读全文

posted @ 2015-07-31 10:38 amazingzoe 阅读(169) 评论(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 n... 阅读全文

posted @ 2015-07-30 11:10 amazingzoe 阅读(132) 评论(0) 推荐(0)

Unique Binary Search Tree II ***

摘要：Givenn, generate all structurally uniqueBST's(binary search trees) that store values 1...n.For example,Givenn= 3, your program should return all 5 uni... 阅读全文

posted @ 2015-07-30 00:32 amazingzoe 阅读(129) 评论(0) 推荐(0)

Unique Binary Search Tree

摘要：Givenn, how many structurally uniqueBST's(binary search trees) that store values 1...n?For example,Givenn= 3, there are a total of 5 unique BST's. 1... 阅读全文

posted @ 2015-07-29 23:27 amazingzoe 阅读(153) 评论(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.Analyse: The l... 阅读全文

posted @ 2015-07-29 21:27 amazingzoe 阅读(169) 评论(0) 推荐(0)

随笔分类 - Leetcode

公告