/// <summary>
  /// 樹(shù)節(jié)點(diǎn)對(duì)象
  /// </summary>
  public class TreeNode
  {
    /// <summary>
    /// 節(jié)點(diǎn)的最小值
    /// </summary>
    public int ValueFrom { get; set; }

    /// <summary>
    /// 節(jié)點(diǎn)的最大值
    /// </summary>
    public int ValueTo { get; set; }

    /// <summary>
    /// 在節(jié)點(diǎn)范圍內(nèi)的數(shù)量
    /// </summary>
    public int Count { get; set; }

    /// <summary>
    /// 節(jié)點(diǎn)高度（樹(shù)的層級(jí)）
    /// </summary>
    public int Height { get; set; }

    /// <summary>
    /// 父節(jié)點(diǎn)
    /// </summary>
    public TreeNode Parent { get; set; }

    /// <summary>
    /// 左子節(jié)點(diǎn)
    /// </summary>
    public TreeNode LeftChildNode { get; set; }

    /// <summary>
    /// 右子節(jié)點(diǎn)
    /// </summary>
    public TreeNode RightChildNode { get; set; }
  }

  public class RankBinaryTree
  {
    /// <summary>
    /// 根節(jié)點(diǎn)
    /// </summary>
    private TreeNode _root;

  }

   /// <summary>
    /// 構(gòu)造函數(shù)初始化根節(jié)點(diǎn)
    /// </summary>
    /// <param name="max"></param>
    public RankBinaryTree(int max)
    {
      _root = new TreeNode() { ValueFrom = 0, ValueTo = max+1, Height = 1 };
      _root.LeftChildNode = CreateChildNode(_root, 0, max / 2);
      _root.RightChildNode = CreateChildNode(_root, max / 2, max);
    }

    /// <summary>
    /// 遍歷創(chuàng)建子節(jié)點(diǎn)
    /// </summary>
    /// <param name="current"></param>
    /// <param name="min"></param>
    /// <param name="max"></param>
    /// <returns></returns>
    private TreeNode CreateChildNode(TreeNode current, int min, int max)
    {
      if (min == max) return null;
      var node = new TreeNode() { ValueFrom = min, ValueTo = max, Height = current.Height + 1 };
      node.Parent = current;
      int center = (min + max) / 2;
      if (min < max - 1)
      {
        node.LeftChildNode = CreateChildNode(node, min, center);
        node.RightChildNode = CreateChildNode(node, center, max);
      }
      return node;
    }

  /// <summary>
    /// 往樹(shù)中插入一個(gè)值
    /// </summary>
    /// <param name="value"></param>
    public void Insert(int value)
    {
      InnerInsert(_root, value);
      _data.Add(value);
    }

    /// <summary>
    /// 子節(jié)點(diǎn)判斷范圍遍歷插入
    /// </summary>
    /// <param name="node"></param>
    /// <param name="value"></param>
    private void InnerInsert(TreeNode node, int value)
    {
      if (node == null) return;
      //判斷是否在這個(gè)節(jié)點(diǎn)范圍內(nèi)
      if (value >= node.ValueFrom && value < node.ValueTo)
      {
        //更新節(jié)點(diǎn)總數(shù)信息
        node.Count++;
        //更新左子節(jié)點(diǎn)
        InnerInsert(node.LeftChildNode, value);
        //更新右子節(jié)點(diǎn)
        InnerInsert(node.RightChildNode, value);
      }
    }

   /// <summary>
    /// 從樹(shù)中獲取總排名
    /// </summary>
    /// <param name="value"></param>
    /// <returns></returns>
    public int GetRank(int value)
    {
      if (value < 0) return 0;
      return InnerGet(_root, value);
    }

    /// <summary>
    /// 遍歷子節(jié)點(diǎn)獲取累計(jì)排名
    /// </summary>
    /// <param name="node"></param>
    /// <param name="value"></param>
    /// <returns></returns>
    private int InnerGet(TreeNode node, int value)
    {
      if (node.LeftChildNode == null || node.RightChildNode == null) return 1;
      if (value >= node.LeftChildNode.ValueFrom && value < node.LeftChildNode.ValueTo)
      {
        //當(dāng)這個(gè)值存在于左子節(jié)點(diǎn)中時(shí)，要累加右子節(jié)點(diǎn)的總數(shù)（表示這個(gè)數(shù)在多少名之后）
        return node.RightChildNode.Count + InnerGet(node.LeftChildNode, value);
      }
      else
      {
        //如果在右子節(jié)點(diǎn)中就繼續(xù)遍歷
        return InnerGet(node.RightChildNode, value);
      }
    }