LeetCode--Lowest Common Ancestor of a Binary Tree、Binary Tree Paths

最新推荐文章于 2023-02-25 22:41:55 发布

slbyzdgz

最新推荐文章于 2023-02-25 22:41:55 发布

阅读量109

点赞数

本文链接：https://blog.csdn.net/qq_27318693/article/details/97417285

版权

236. 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: “The lowest common ancestor is defined between two nodes p and q as the lowest node in T that has both p and q as descendants (where we allow a node to be a descendant of itself).”

Given the following binary tree: root = [3,5,1,6,2,0,8,null,null,7,4]

Example 1:

Input: root = [3,5,1,6,2,0,8,null,null,7,4], p = 5, q = 1
Output: 3
Explanation: The LCA of nodes 5 and 1 is 3.

Example 2:

Input: root = [3,5,1,6,2,0,8,null,null,7,4], p = 5, q = 4
Output: 5
Explanation: The LCA of nodes 5 and 4 is 5, since a node can be a descendant of itself according to the LCA definition.

给定一个二叉树, 找到该树中两个指定节点的最近公共祖先。

百度百科中最近公共祖先的定义为：“对于有根树 T 的两个结点 p、q，最近公共祖先表示为一个结点 x，满足 x 是 p、q 的祖先且 x 的深度尽可能大（一个节点也可以是它自己的祖先）。”

思路：如果root为None或p或q，则返回none，如果不是，则进行左右子树的递归，如果p和q分别存在两个子树上，则返回当前root结点，如果都存在在左子树或右子树上，继续递归

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution(object):
    def lowestCommonAncestor(self, root, p, q):
        """
        :type root: TreeNode
        :type p: TreeNode
        :type q: TreeNode
        :rtype: TreeNode
        """
        if root in (None,p,q):
            return root
        leftnode=self.lowestCommonAncestor(root.left,p,q)
        rightnode=self.lowestCommonAncestor(root.right,p,q)
        if leftnode and rightnode:
            return root
        elif leftnode:
            return leftnode
        else:
            return rightnode

257. Binary Tree Paths

Given a binary tree, return all root-to-leaf paths.

Note: A leaf is a node with no children.

Example:

Input:

   1
 /   \
2     3
 \
  5

Output: ["1->2->5", "1->3"]

Explanation: All root-to-leaf paths are: 1->2->5, 1->3

给定一个二叉树，返回所有从根节点到叶子节点的路径。

说明: 叶子节点是指没有子节点的节点。

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution(object):
    def binaryTreePaths(self, root):
        """
        :type root: TreeNode
        :rtype: List[str]
        """
        res=[]
        if root is None:
            return res
        if not root.left and not root.right:
            res.append(str(root.val))
            return res
        for i in self.binaryTreePaths(root.left):
            res.append(str(root.val)+'->'+i)
        for j in self.binaryTreePaths(root.right):
            res.append(str(root.val)+'->'+j)
        return res