Difference between Tree edge and Back edge in graph Last Updated : 13 Jan, 2021 Summarize Comments Improve Suggest changes Share Like Article Like Report Tree Edge: It is an edge that is present in the tree obtained after performing DFS on the graph. All the Green edges are tree edges as shown in the below image. Back Edge: It is an edge (u, v) such that v is an ancestor of node u but not part of the DFS Traversal of the tree. Edge from 5 to 4 is a back edge. The presence of a back edge indicates a cycle in a directed graph. Consider an undirected graph is given below, the DFS of the below graph is 3 1 2 4 6 5. In the below diagram, if the DFS is applied to this graph, a tree is obtained which is connected using green edges. Tabular between the back Edge and tree Edge: S.N.Tree EdgeBack Edge1It connects the node to its descendants.It connects the node to its ancestors.2It is the path traversed during DFS.It is the path not visited during DFS.3They can form bridges.They can never form bridges.4If it is disconnected, the number of connected components may increase.Even if it is disconnected, the number of connected components remains the same.5It never creates a cycle.It can create a cycle. Comment More infoAdvertise with us Next Article Difference between General tree and Binary tree A aktmishra143 Follow Improve Article Tags : Tree Graph Difference Between DSA Practice Tags : GraphTree Similar Reads Difference Between Graph and Tree Graphs and trees are two fundamental data structures used in computer science to represent relationships between objects. While they share some similarities, they also have distinct differences that make them suitable for different applications. Difference Between Graph and Tree What is Graph?A grap 2 min read Tree, Back, Edge and Cross Edges in DFS of Graph Given a directed graph, the task is to identify tree, forward, back and cross edges present in the graph.Note: There can be multiple answers.Example:Input: GraphOutput:Tree Edges: 1->2, 2->4, 4->6, 1->3, 3->5, 5->7, 5->8 Forward Edges: 1->8 Back Edges: 6->2 Cross Edges: 5- 9 min read Difference between B tree and B+ tree B-Tree: B-Tree is known as a self-balancing tree as its nodes are sorted in the inorder traversal. In B-tree, a node can have more than two children. B-tree has a height of logM N (Where ‘M’ is the order of tree and N is the number of nodes). And the height is adjusted automatically at each update. 3 min read Difference between Binary tree and B-tree B-Tree : B-Tree is known as a self-balancing tree as its nodes are sorted in the inorder traversal. Unlike the binary trees, in B-tree, a node can have more than two children. B-tree has a height of logM N (Where ‘M’ is the order of tree and N is the number of nodes). And the height adjusts automati 7 min read Difference between General tree and Binary tree General Tree: In the data structure, General tree is a tree in which each node can have either zero or many child nodes. It can not be empty. In general tree, there is no limitation on the degree of a node. The topmost node of a general tree is called the root node. There are many subtrees in a gene 2 min read Difference between Stack and Tree Stack: A Stack is a linear data structure in which elements can be inserted and deleted only from one side of the list, called the top. Insertion is called push operation and deletion is called pop operation in case of the stack. The order of insertion and deletion may be LIFO(Last In First Out) i.e 2 min read Like