Lowest Common Ancestor II
Given the root and two nodes in a Binary Tree. Find the lowest common ancestor(LCA) of the two nodes.
Recent posts
Same Tree
Check if two binary trees are identical. Identical means the two binary trees have the same structure and every identical position has the same value.
Flatten Binary Tree to Linked List
Flatten a binary tree to a fake “linked list” in pre-order traversal.
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.
Clone Binary Tree
For the given binary tree, return a deep copy of it.
Convert Binary Tree to Linked Lists by Depth
Given a binary tree, design an algorithm which creates a linked list of all the nodes at each depth.
Insert Five
Given a number, insert a 5 at any position of the number to make the number after insertion the largest
Binary Tree Postorder Traversal-null
Given a binary tree, return the postorder traversal of its nodes’ values. (Iteratively)