Timeline for What exactly is the difference between a Balanced Binary Search Tree and an AVL tree?
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 14, 2020 at 23:35 | answer | added | davidbuzatto | timeline score: 2 | |
| Oct 14, 2020 at 23:08 | comment | added | nTuply | @davidbuzatto Yes, I'm getting a bit confused with the concepts. The source for the Balanced BSt is geeksforgeeks.org/sorted-array-to-balanced-bst . You will notice they have an implementation of it in the link. However, the output it different when compared to an AVL implementaion | |
| Oct 14, 2020 at 22:46 | comment | added | davidbuzatto | As you said, AVL tree is a kind of Balanced Binary Search Tree. I think that maybe you are getting confused with the concepts, don't you? What is your source for this Balanced BST that you are talking about? | |
| Oct 14, 2020 at 22:20 | history | asked | nTuply | CC BY-SA 4.0 |