如果二叉搜索树的预订遍历是6,2,1,4,3,7,10,9,11,那么如何获得后序遍历？
algorithm tree-traversal binary-search-tree data-structures
algorithm ×1
binary-search-tree ×1
data-structures ×1
tree-traversal ×1