**Definition:**
At each level, every node have atmost 2 childs.

- A non empty binary tree has a root element.

- The remaining elements(if any) are partitioned into two binary tree.

- These are called the left and right subtree of the tree.

-A binary tree may be empty, a tree cannot be empty.

-The subtrees of the Binary tree are ordered while subtree of tree are not ordered.

- Introduction to Tree Data Structure
- Binary Tree in Data structure
- Binary search Tree in Data structure
- AVL tree in data structure
- Complete binary search in data structure
- Full Binary Tree in Data structure
- Heap Tree in Data Structure
- Minimum Spanning Tree
- Introduction to graph
- DFS algorithms
- BFS algorithms

R4Rin Top Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on R4R.in website is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!