P556 Pre-Post

    ID: 556 传统题 1000ms 256MiB 尝试: 2 已通过: 1 难度: 5 上传者: 标签>上海交通大学机试题二叉树组合数

Pre-Post

题目描述

We are all familiar with pre-order, in-order and post-order traversals of binary trees. A common problem in data structure classes is to find the pre-order traversal

🔒
登录后查看完整题面
登录后查看题目

统计