二叉树前中后序的非递归方法--迭代--Python
二叉树的遍历的先中后与层序遍历递归方法# Definition for a binary tree node.# class TreeNode:# def __init__(self, val=0, left=None, right=None):# self.val = val# self.left = left# self.right = rightclass Solution: def __init__(self):
原创
2020-09-30 14:56:25 ·
158 阅读 ·
0 评论