anonymous
  • anonymous
I need to write an algorithm for determining the height of a binary search tree. How would I go about doing that?
Computer Science
  • Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
jamiebookeater
  • jamiebookeater
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
osanseviero
  • osanseviero
Which programming language? C++, C, C#, Python, Ruby?
anonymous
  • anonymous
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!
osanseviero
  • osanseviero
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

Looking for something else?

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

More answers

anonymous
  • anonymous
awesome, thanks so much, i appreciate it!

Looking for something else?

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