Binary trees are important data structures in computer science and are mostly used for search trees like AVL tree, red black tree and splay tree.
If a binary tree balanced then is the access of any element in worst case:
O(log n)
It follows algorithm for an unbalanced binary tree and a balanced AVL tree.