Which of the 2 scenarios would result in a faster balanced BST big O time in comparison to balanced BT big O time?Creating a list of all elements in the tree in preorder.I think that having a balanced BST wouldn't give you any leverage over a balanced BT because preorder allows follows the order: root, left, right procedure so the time it takes to process entirely depends on the length of the tree. I don't know if this is right because it seems like it's a case that go go both ways.Removing all leaves from a tree.Again I feel like it could go both ways since they are both balanced but I'm leaning towards BST out of instinct but I don't know why.
Balanced BST vs Balanced BT faster big O time for 2 scenarios
binary trees;binary search trees