摘要: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 @ 2019-06-05 16:37 douzujun 阅读 (63) 评论 (0) 编辑
摘要:Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as: a binary tree in which the dep 阅读全文
posted @ 2019-06-05 16:28 douzujun 阅读 (35) 评论 (0) 编辑
摘要:Given a n-ary 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 @ 2019-06-05 16:25 douzujun 阅读 (30) 评论 (0) 编辑
摘要: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 l 阅读全文
posted @ 2019-06-05 16:24 douzujun 阅读 (40) 评论 (0) 编辑
摘要: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 @ 2019-06-05 16:01 douzujun 阅读 (51) 评论 (0) 编辑
摘要:Given a binary tree, return all root-to-leaf paths. Note: A leaf is a node with no children. Example: 阅读全文
posted @ 2019-06-05 15:20 douzujun 阅读 (58) 评论 (0) 编辑
摘要:100. Same Tree 100. Same Tree Given two binary trees, write a function to check if they are the same or not. Two binary trees are considered the same 阅读全文
posted @ 2019-05-26 22:14 douzujun 阅读 (42) 评论 (0) 编辑
摘要:108. Convert Sorted Array to Binary Search Tree 108. Convert Sorted Array to Binary Search Tree Given an array where elements are sorted in ascending 阅读全文
posted @ 2019-05-26 18:34 douzujun 阅读 (109) 评论 (0) 编辑
摘要:538. Convert BST to Greater Tree 538. Convert BST to Greater Tree Given a Binary Search Tree (BST), convert it to a Greater Tree such that every key o 阅读全文
posted @ 2019-05-26 13:03 douzujun 阅读 (119) 评论 (0) 编辑
摘要:993. Cousins in Binary Tree 993. Cousins in Binary Tree In a binary tree, the root node is at depth 0, and children of each depth knode are at depth k 阅读全文
posted @ 2019-05-25 16:17 douzujun 阅读 (74) 评论 (0) 编辑
Flag Counter