Question

Balanced Binary Tree vs Complete Tree

Insertion and Deletion is faster in which of the above 2 structures?

Comments

Assuming pointer to node which need to be deleted given

Balanced Binary Tree insertion = O(logn), deletion= O(logn)

Complete Tree insertion = O(1), deletion= O(1)

Assuming pointer to node which need to be deleted  not given

Balanced Binary Tree insertion = O(logn), deletion= O(n)

Complete Tree insertion = O(1), deletion= O(n)

---

Assuming pointer to node which need to be deleted  not given

Balanced Binary Tree insertion = O(logn), deletion= O(n)

Complete Tree insertion = O(1), deletion= O(n)

I think you meant this ?

---

now check i wrote wrong.

---

Useful read: http://bigocheatsheet.com/pdf/big-o-cheatsheet.pdf