# Tree and graphs are the non-linear Data structure

## Introduction to Tree Data Structure

Tree is the non-linear Data structure

## Binary Tree in Data structure

Binary tree is tree in which each node have atmost 2 node

## Binary search Tree in Data structure

Binary search tree is the updated form of binary tree in which left node have less value and right node have higher value

## AVL tree in data structure

AVL tree is the binary tree at which each node have balancing factor of -1,0,1

## Complete binary search in data structure

Complete binary tree is the updated form of binary tree

## Full Binary Tree in Data structure

Full binary tree is the tree in which each node have exactly 2 sub-child

## Minimum Spanning Tree

A spanning tree with minimum weight is called minimum spanning tree

## Introduction to graph

Graph is the non-linear data structure

## DFS algorithms

DFS(depth first search ) algorithm is used to traverse the graph

## BFS algorithms

BFS stands for breath first search used for traverse the graph

Tree & Graph Data Structure,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
##### R4R Team
R4Rin Top Tutorials are 300 Python programs | Python Examples | Python Examples Code | Python basic examples | Python basic Examples for beginners.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!