[leetcode]Path Sum
摘要：
Path SumGiven 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 give... 阅读全文
[leetcode]Balanced Binary Tree
摘要：
Balanced Binary TreeGiven a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tre... 阅读全文
[leetcode]Convert Sorted Array to Binary Search Tree
摘要：
Convert Sorted Array to Binary Search TreeGiven an array where elements are sorted in ascending order, convert it to a height balanced BST.算法：根据有序数组，生... 阅读全文
[leetcode]Construct Binary Tree from Inorder and Postorder Traversal
摘要：
Construct Binary Tree from Inorder and Postorder TraversalGiven inorder and postorder traversal of a tree, construct the binary tree.Note:You may assu... 阅读全文
[leetcode]Construct Binary Tree from Preorder and Inorder Traversal
摘要：
Construct Binary Tree from Preorder and Inorder TraversalGiven preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume... 阅读全文
[leetcode]Minimum Depth of Binary Tree
摘要：
Minimum Depth of Binary TreeGiven a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root... 阅读全文
[leetcode]Maximum Depth of Binary Tree
摘要：
Maximum Depth of Binary TreeGiven a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root ... 阅读全文
[leetcode]Same Tree
摘要：
Same TreeGiven two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally ide... 阅读全文
[leetcode]Symmetric Tree
摘要：
Symmetric TreeGiven a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric... 阅读全文
[leetcode]Recover Binary Search Tree
摘要：
Recover Binary Search TreeTwo elements of a binary search tree (BST) are swapped by mistake.Recover the tree without changing its structure.Note:A sol... 阅读全文