Jump to content
Urch Forums

vlad88

Members
  • Posts

    1
  • Joined

Everything posted by vlad88

  1. Hi, Show that every n-node binary search tree is not equally likely (assuming items are inserted in random order), and that balanced trees are more probable than straight-line trees. How is it prove mathematical?
×
×
  • Create New...