Quantcast

Got Homework?

Connect with other students for help. It's a free community.

  • across
    MIT Grad Student
    Online now
  • laura*
    Helped 1,000 students
    Online now
  • Hero
    College Math Guru
    Online now

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

Napervillian Group Title

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

  • 2 years ago
  • 2 years ago

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

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

    • 2 years ago
  2. Napervillian Group Title
    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!

    • 2 years ago
  3. osanseviero Group Title
    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

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

    awesome, thanks so much, i appreciate it!

    • 2 years ago
    • Attachments:

See more questions >>>

Your question is ready. Sign up for free to start getting answers.

spraguer (Moderator)
5 → View Detailed Profile

is replying to Can someone tell me what button the professor is hitting...

23

  • Teamwork 19 Teammate
  • Problem Solving 19 Hero
  • You have blocked this person.
  • ✔ You're a fan Checking fan status...

Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.

This is the testimonial you wrote.
You haven't written a testimonial for Owlfred.