# Tag Info

### Example of binary trees with maximum rotation distance

You want to find an example of Graph diameter of Tamari lattice of order $n$ $\ (n\geq 11)$ is $2n-6$ i.e. The maximum rotation distance between $n(n\geq 11)$-node binary trees is $2n-6$ The graph ...
• 101
1 vote

### Is this a valid AVL tree?

An AVL tree is a BST that satisfies the following property (known as the AVL property): for each node, the difference in height between the left child and right child should be at most 1. Note that ...
• 1,388
1 vote

### Is this a valid AVL tree?

Yes, your tree is balanced as per the definition of an AVL tree. Typically, we are interested in balanced search trees. Thus, you should consider the binary search tree (BST) properties as well, along ...
• 1,860

### Is this a valid AVL tree?

Yes, that's an AVL tree. In fact, that's a particular case of AVL tree, where you seek to maximize the difference in size between left and right children at each node. Those trees are called Fibonacci ...
• 15.9k
A full binary tree is a binary tree where every node is either a leaf or is internal with two children. Is such a tree has $k$ internal nodes then it has $k+1$ leaves. Thus when the total number of ...