二叉樹深度DFS:前中後序:遞歸與迭代 & 層次遍歷BFS

二叉樹構建:html class TreeNode:     def __init__(self, x):         self.val = x         self.left = None         self.right = None l1 = TreeNode(3)  l1.left = TreeNode(2) l1.right = TreeNode(5) l1.left.l
相關文章
相關標籤/搜索