Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

Napervillian

  • 4 years ago

I need to write an algorithm for determining the height of a binary search tree. How would I go about doing that?

  • This Question is Closed
  1. osanseviero
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    Which programming language? C++, C, C#, Python, Ruby?

  2. Napervillian
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    it's in psudeo code. i just can't figure out how to make sure i have the deepest node. any language you know would be incredibly helpful. thank you!

  3. osanseviero
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    http://www.cs.cmu.edu/~pattis/15-1XX/15-200/lectures/treeprocessing/index.html I dont know exactly how to do that, but you can check the "searching" section. There is the algorithm you are searching

  4. Napervillian
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    awesome, thanks so much, i appreciate it!

  5. Not the answer you are looking for?
    Search for more explanations.

    • Attachments:

Ask your own question

Sign Up
Find more explanations on OpenStudy
Privacy Policy