虫虫首页| 资源下载| 资源专辑| 精品软件
登录| 注册

您现在的位置是:虫虫下载站 > 资源下载 > 数值算法/人工智能 > 北京大学ACM比赛题目 Consider an infinite full binary search tree (see the figure below), the numbers in the

北京大学ACM比赛题目 Consider an infinite full binary search tree (see the figure below), the numbers in the

  • 资源大小:14 K
  • 上传时间: 2013-12-16
  • 上传用户:xackw
  • 资源积分:2 下载积分
  • 标      签: the Consider infinite numbers

资 源 简 介

北京大学ACM比赛题目 Consider an infinite full binary search tree (see the figure below), the numbers in the nodes are 1, 2, 3, .... In a subtree whose root node is X, we can get the minimum number in this subtree by repeating going down the left node until the last level, and we can also find the maximum number by going down the right node. Now you are given some queries as "What are the minimum and maximum numbers in the subtree whose root node is X?" Please try to find answers for there queries.

相 关 资 源