Home Sign Up Sign In
chinasunyingjian
V2EX  ›  问与答

关于折半查找判定树的定义的问题

  •   
  •   chinasunyingjian · Nov 15, 2018 via Android · 2277 views
    This topic created in 2769 days ago, the information mentioned may be changed or developed.

    请问各位大佬，折半查找判定树是指通过折半查找画出来的一整颗树还是指从根结点到被查找节点的最小判定树呢。

    No Comments Yet
    About   ·   Help   ·   Advertise   ·   Blog   ·   API   ·   FAQ   ·   Solana   ·   3273 Online   Highest 6679   ·     Select Language
    创意工作者们的社区
    World is powered by solitude
    VERSION: 3.9.8.5 · 33ms · UTC 12:15 · PVG 20:15 · LAX 05:15 · JFK 08:15
    ♥ Do have faith in what you're doing.