AVL tree is a self balancing binary search tree, where difference of right subtree and left subtree height to a node is at most 1. A self-balancing binary
Binary search tree is a binary tree with following properties: Left sub tree of a node always contains lesser key Right subtree of a node always contains greater
Traversing a tree refers to visiting each node once. Interestingly, a tree has multiple ways of traversing the nodes, unlike linked list and array which have just one
A tree is a hierarchical data structure, unlike array and linked list(which are known as a linear data structure). Saying hierarchy means nodes(or vertices) are ordered in top
