ddd

分类

/ 注册

全部文章（共91篇）

题解 | #二叉搜索树的最近公共祖先#

# class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None # # 代码中的类名、方法名、参数名已经指定，请勿...

2023-11-06

0 189

题解 | #在二叉树中找到两个节点的最近公共祖先#

# class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None # # 代码中的类名、方法名、参数名已经指定，请勿...

2023-11-06

0 224

题解 | #二叉树中和为某一值的路径(三)#

# class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None # # 代码中的类名、方法名、参数名已经指定，请勿...

2023-11-03

0 225

题解 | #序列化二叉树#

# -*- coding:utf-8 -*- # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None cl...

2023-11-02

0 258

题解 | #把二叉树打印成多行#

import queue # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None # # 代码中的类名、方...

2023-11-01

0 2213

题解 | #对称的二叉树#

# class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None # # 代码中的类名、方法名、参数名已经指定，请勿...

2023-10-31

0 526

题解 | #二叉树的下一个结点#

# class TreeLinkNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None # self.next =...

2023-10-31

0 205

题解 | #判断是不是平衡二叉树#

# class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None # # 代码中的类名、方法名、参数名已经指定，请勿...

2023-10-31

0 2516

题解 | #二叉搜索树与双向链表#

# class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None # # # @param pRootOfTre...

2023-10-30

0 245

题解 | #二叉树中和为某一值的路径(二)#

# class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None # # 代码中的类名、方法名、参数名已经指定，请勿...

2023-10-30

0 200