Tree - Michael's Blog

Tree

A collection of 8 posts

Binary Tree Preorder Traversal

144. Binary Tree Preorder Traversal [https://leetcode.com/problems/binary-tree-preorder-traversal/?tab=Description] Given a binary tree, return the preorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3}, 1 \ 2 / 3 return [1,2,3]. Note: Recursive solution is trivial, could you do it iteratively? class

Binary Tree Inorder Traversal

94. Binary Tree Inorder Traversal [http://www.lintcode.com/en/problem/binary-tree-inorder-traversal] Given a binary tree, return the inorder traversal of its nodes' values. For example: Given binary tree [1,null,2,3], 1 \ 2 / 3 return [1,3,2]. Note: Recursive solution is trivial, could you do it iteratively?

Binary Tree Maximum Path Sum

[124. Binary Tree Maximum Path Sum] Given a binary tree, find the maximum path sum. For this problem, a path is defined as any sequence of nodes from some starting node to any node in the tree along the parent-child connections. The path must contain at least one node and

Binary Tree Longest Consecutive Sequence

Binary Tree Longest Consecutive Sequence [https://leetcode.com/problems/binary-tree-longest-consecutive-sequence/] Given a binary tree, find the length of the longest consecutive sequence path. The path refers to any sequence of nodes from some starting node to any node in the tree along the parent-child connections. The longest consecutive path need

Lowest Common Ancestor of a Binary Tree

236. Lowest Common Ancestor of a Binary Tree [https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/] Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree. According to the definition of LCA on Wikipedia [https://en.wikipedia.org/wiki/Lowest_common_ancestor]: “The lowest common ancestor

Binary Tree Level Order Traversal

102. Binary Tree Level Order Traversal [https://leetcode.com/problems/binary-tree-level-order-traversal/] LintCode-69.Binary Tree Level Order Traversal [http://www.lintcode.com/en/problem/binary-tree-level-order-traversal] Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example: Given binary tree

Binary Tree Path Sum

LintCode-376. Binary Tree Path Sum [http://www.lintcode.com/en/problem/binary-tree-path-sum/] > 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 leaf nodes. > Example: Given a binary

Construct Binary Tree from Inorder and Postorder Traversal

LintCode-72.Construct Binary Tree from Inorder and Postorder Traversal [http://www.lintcode.com/en/problem/construct-binary-tree-from-inorder-and-postorder-traversal/] > Given inorder and postorder traversal of a tree, construct the binary tree. > Notice: You may assume that duplicates do not exist in the tree. > Given inorder [1,2,3] and postorder [1,3,2]