zippera
V2EX  ›  问与答

如何根据边构建二叉树?

  •  
  •   zippera · Aug 21, 2015 via iPhone · 2114 views
    This topic created in 3951 days ago, the information mentioned may be changed or developed.
    给定节点个数 13 ,边数 12 ,并以点对的形式给出 12 个边,如
    1 2 4 5 1 4 …

    给出边的顺序是无序的。对左右子树的顺序不做要求,如上面的 2 可以建成 1 的左子树或右子树。
    No Comments Yet
    About   ·   Help   ·   Advertise   ·   Blog   ·   API   ·   FAQ   ·   Solana   ·   5842 Online   Highest 6679   ·     Select Language
    创意工作者们的社区
    World is powered by solitude
    VERSION: 3.9.8.5 · 33ms · UTC 03:26 · PVG 11:26 · LAX 20:26 · JFK 23:26
    ♥ Do have faith in what you're doing.