2024-10-02 04:18:20 发布
网友
我试图从二叉树的前序和中序遍历中得到后序。 但是我不知道我该怎么做,我的代码的结构应该是什么。 任何帮助都是有用的
例如:
输入:
预订:6214135798
顺序:123456789
输出:
邮购:1354289776
资料来源:http://simpletechtalks.com/construct-a-binary-tree-from-inorder-and-preorder-traversal/#:~:text=Let%E2%80%99s%20look%20into%20the%20algorithm%20to%20construct%20the,the%20selected%20element%20index%20%28inorder_index%29%20in%20Inorder%20list
资料来源:http://simpletechtalks.com/construct-a-binary-tree-from-inorder-and-preorder-traversal/#:~:text=Let%E2%80%99s%20look%20into%20the%20algorithm%20to%20construct%20the,the%20selected%20element%20index%20%28inorder_index%29%20in%20Inorder%20list
相关问题 更多 >
编程相关推荐