Is there any way to get inorder preorder postorder of this tree?? using dfs or bfs

Правка en1, от Anant2961, 2024-05-18 10:38:47

given tree vertices as follow 7 2 0 1 0 2 1 3 1 4 2 5 3 6 3 7 can anyone help me to find the inorder preorder and postorder traversal given in the question is if 0 1 is before than 02 the 1 if left child and 2 is right child is 0 is always the parent now i want to make a tree with that but how to do dfs and print inorder preorder and postorder travresal of this tree

Теги trees, preorder traversal, graphs, disjoint union

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский Anant2961 2024-05-18 10:38:47 461 Initial revision (published)