小白菜又菜

This paper presents a recursive solution to find the lowest common ancestor (LCA) of two nodes in a binary tree. The algorithm recursively searches both subtrees - if the target nodes are found in different subtrees, the current node is the LCA. If both no

摘要： 题目要求在二叉搜索树(BST)中找到两个给定节点的最低公共祖先(LCA)。利用BST的性质，若当前节点值小于p和q的值，则搜索右子树；若大于二者值，则搜索左子树；否则当前节点即为LCA。

【代码】Leetcode 312. Burst Balloons。

【代码】Leetcode 307. Range Sum Query - Mutable。

【代码】Leetcode 212. Word Search II。

【代码】Leetcode 239. Sliding Window Maximum。