1. ► Insert and delete in self-balancing trees happen in linear time

2. ► All binary search trees are balanced

3. ► No node in a binary tree has more than 2 children

4. ► Tree traversal is a linear operation

5. ► Leaf nodes have no children

6. ► In a tree, all nodes are connected

7. ► STL has no tree container

8. ► In a post-order traversal, root nodes comes at the last

9. ► Node values in a binary search tree are ordered

10. ► Search in an unbalanced tree always has O(lg(n)) complexity

11. ► Which of the traversals in binary search tree gives sorted list

12. ► Insertion is O(n) operation in a tree