How would I find the number of 2-3 trees of depth $n$? or in my case depth 4?

  • 1
    $\begingroup$ All leaves in a 2-3 tree have the same depth. How many 2-3 trees are there of height 2? $\endgroup$ Nov 24, 2017 at 20:28
  • $\begingroup$ @FabioSomenzi we're not counting leaves... we're counting number of trees... $\endgroup$
    – Lola1984
    Nov 25, 2017 at 1:56
  • $\begingroup$ Certainly, but the fact that the depth is uniform makes counting easier. I invite you to start from the easy cases. There's exactly one empty 2-3 tree. There are exactly 2 trees with one node. What happens next? $\endgroup$ Nov 25, 2017 at 2:09


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.