jasminemzy

摘要： Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root). Exam 阅读全文

摘要： Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). Example Given binary tree {3,9,2 阅读全文

摘要： Convert a binary search tree to doubly linked list with in-order traversal. Example Given a binary search tree: 4 / \ 2 5 / \ 1 3 return 1<->2<->3<->4 阅读全文

摘要： Given a binary search tree (See Definition) and a node in it, find the in-order successor of that node in the BST. If the given node has no in-order s 阅读全文

摘要： Given a binary tree, find the maximum path sum. The path may start and end at any node in the tree. Example Given the below binary tree: 1 / \ 2 3 ret 阅读全文

摘要： Given a binary tree, find the maximum path sum from root. The path may end at any node in the tree and contain at least one node in it. Example Given 阅读全文

摘要： Your are given a binary tree in which each node contains a value. Design an algorithm to get all paths which sum to a given value. The path does not n 阅读全文

摘要： Given a binary tree, find all paths that sum of the nodes in the path equals to a given number target. A valid path is from root node to any of the le 阅读全文

摘要： It's follow up problem for Binary Tree Longest Consecutive Sequence II Given a k-ary tree, find the length of the longest consecutive sequence path.Th 阅读全文

摘要： Given a binary tree, find the length of the longest consecutive sequence path.The path could be start and end at any node in the tree Example 1 / \ 2 阅读全文