Can you identify tree(s)?
Computer Science
Level
1
Binary Search Tree
Dancing Tree
Binary Tree
AVL Tree
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
The tree given in the figure satisfies to be Binary because it has nodes with at most 2 children but does not satisfy the search property to be a BST which is: n o d e → l e f t → d a t a ≤ n o d e → d a t a ≤ n o d e → r i g h t → d a t a Moreover an AVL Tree is also a type of BST (Binary Search Tree). Hence it (the tree) lies only in the category of Binary Trees :)