Survey Results - Can you, without looking it up, write code to convert any Binary Search Tree to a Balanced Binary Search Tree?

and I will find a solution, don't give me academic tests when I've been out of University 10 years ago.

Besides, you can call them Fnord Tree and R'lyeh Tree for what is worth.

GCS d--(d+) s-/++ a C++++ U+++ P- L+@ E-- W++ N+ o+ K- w+++ O? M-- V? PS+ PE- Y+ PGP t+ 5? X R+++ tv-- b+(+++) DI+++ D++ G e++ h--- r+++ y+++* Weapons extension: ma- k++ F+2 X

I've never needed anything like this in my long career as a developer...

I know that some libraries I use implement BTrees to do stuff Wink | ;)

but never ever in my 40 years coder life did I implement one.
That's what we use libraries for, isn't it ?

Not since college homework

Exactly

if you've ever needed any kind of set/map/dictionary collection, it's probably using a self-balancing binary tree under the hood.

Way back in the '80s, I wrote my own implementation of a balanced BST in Pascal, using the algorithm I found in Knuth. If I had to, I could do it today by re-reading the book.

Freedom is the freedom to say that two plus two make four. If that is granted, all else follows.
-- 6079 Smith W.

I'd have to look up what exactly a Balanced tree was before I started - it's just been too long since I needed to know that for exams, and I've not had to create even a BST once since I left Uni.

I still think it's important to learn them though - so at least you know they exist if you do ned them at some point in your career, and can then try to remember how to implement one.

I just checked what a BBST is, and now I remember. I did it a few times at Uni, and I could do it in about twenty minutes or so including testing. Maybe half an hour - setup of the node structure and sample data for testing is a little time consuming.

"I have no idea what I did, but I'm taking full credit for it." - ThisOldTony
"Common sense is so rare these days, it should be classified as a super power" - Random T-shirt
AntiTwitter: @DalekDave is now a follower!

OriginalGriff wrote:
it's just been too long since I needed to know that for exams, and I've not had to create even a BST once since I left Uni.

I had not even to create one during studies...

OriginalGriff wrote:
o at least you know they exist if you do ned them at some point in your career, and can then try to remember how to implement one.

I know that they exist, but had never need them (yet)

M.D.V.

If something has a solution... Why do we have to worry about?. If it has no solution... For what reason do we have to worry about?
Help me to understand what I'm saying, and I'll explain it better to you
Rating helpful answers is nice, but saying thanks can be even nicer.

Option	Votes	%
Yes I can, and every developer should be able to as well	13	1.69
Yes, I can, but it's not really that important	38	4.94
I did it for an interview question and have never done it since.	15	1.95
I knew how to once, but the details are fuzzy	139	18.08
Maybe, probably, not 100% sure	97	12.61
No,. I don't think I could	278	36.15
I don't even know what a Binary Search Tree is, let alone a balanced one	189	24.58
Total	769	100%