https://leetcode.com/submissions/detail/32662938/ Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes ...

/lowest-common-ancestor-of-a-binary-tree-part-ii.html (1) Is the tree a BST or not? BST的话，我们就能按照BS ...

题目： 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 ...

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 ...

题目： Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST. According to the definition of LCA ...

Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST. According to the definition of LCA ...

Given a rooted binary tree, return the lowest common ancestor of its deepest leaves. Recall that: The node of a binary tree is a leaf ...

问题：给一个二叉树，写一个算法判断这个树是不是balanced。 Solution #1. 第一次遇到这个问题时我的解法，如下： 写了一个getDepth()函数，访问每个节点都要调用一次这个函数。这个Solution也通过了leetcode的验证程序，但是后来想了想，I ...