我對數(shù)據(jù)結構和遞歸相當陌生。因此，我決定嘗試實現(xiàn)一種方法，該方法將在此給定樹中打印右側(cè)子樹的所有節(jié)點的所有值（按升序排列，即：50，65，72，91，99），就像學習經(jīng)驗一樣。這是我正在使用的樹，視覺上。我在理解如何通過正確的子樹遞歸方面遇到了很多問題。這就是我到目前為止嘗試過的方法（實際方法在底部）：class BinarySearchTree:    _root: Optional[Any]    # The left subtree, or None if the tree is empty.    _left: Optional[BinarySearchTree]    # The right subtree, or None if the tree is empty.    _right: Optional[BinarySearchTree]def __init__(self, root: Optional[Any]) -> None:    """Initialize a new BST containing only the given root value.    """    if root is None:        self._root = None        self._left = None        self._right = None    else:        self._root = root        self._left = BinarySearchTree(None)        self._right = BinarySearchTree(None)def is_empty(self) -> bool:    """Return True if this BST is empty.    >>> bst = BinarySearchTree(None)    >>> bst.is_empty()    True    """    return self._root is None# That is what I have tried doing so far.def print_right_subtree(self) -> None:    """Print the right subtree in order    >>> bst = BinarySearchTree(41)    >>> left = BinarySearchTree(20)    >>> left._left = BinarySearchTree(11)    >>> left._right = BinarySearchTree(29)    >>> left._right._right = BinarySearchTree(32)    >>> right = BinarySearchTree(65)    >>> right._left = BinarySearchTree(50)    >>> right._right = BinarySearchTree(91)    >>> right._right._left = BinarySearchTree(72)    >>> right._right._right = BinarySearchTree(99)    >>> bst._left = left    >>> bst._right = right    >>> bst.print_right_subtree()    50    65    72    91    99    """    if self.is_empty():        pass    else:        # I am not really sure what to do here...         # I have tried setting self._left = None, but that just made things even more complicated!        print(self._root)        self._right.print_right_subtree()任何幫助將不勝感激！另外，如果你們中的任何一個人有一個我可以遵循的教程，那對于像我這樣的新手來說真的很棒，:)。