Binary tree

1. It is acyclic
2. No two node can be similar or identical
3. It is recursive
4. There is only one unique path between two nodes.
5. Rooted data structure OR Linear data structure OR Dynamic data structure
6. Every node has a maximum of two sub nodes ( or maximum degree 2 )

This entry was posted in Basic. Bookmark the permalink.

Leave a Reply

Your email address will not be published. Required fields are marked *