前序遍历+中序遍历=后序遍历

def find_post(pre_str: str, mid_str: str) -> str: if not pre_str: return "" post_str = "" root_in_mid = mid_str.find(pre_str[0]) ltree_rlimit = 0 for
posted @ 2020-07-31 14:53  玉北  阅读(142)  评论(0)  编辑  收藏  举报