Difference between Graph and Tree

Graph Vs. Tree: Explore the difference between Graph and Tree

In the programming world, trees and graphs are important factors and depict nonlinear data. A tree is an exceptional case of a graph which does not loop whereas graphs can have loops. Both graph and tree share some common features but they do have some differences. Let’s explore the differences between tree and graph.

What is a Tree?

In the computer science world, a tree is renowned as a hierarchical and nonlinear data structure that directly stores data in a hierarchical manner.

What is Graph?

In the computer science world, a graph is popular as a non-linear data structure that is generally used to depict the flow of computation. It is also connected by nodes and edges.





It is a non-linear data structure.

It is also a non-linear data structure.


A graph is a set of vertices/nodes and edges.

A tree is a set of nodes and edges.


In the graph, there is no unique node which is known as root.

In a tree, there is a unique node which is known as root.


Each node can have several edges.

Usually, a tree can have several child nodes, and in the case of binary trees, each node consists of two child nodes.


Graphs can form cycles.

Trees cannot form a cycle.

Keep learning and stay tuned to get the latest updates on GATE along with GATE Preparation Books & GATE Answer Key and more.

Leave a Comment

Your Mobile number and Email id will not be published.