Please subscribe to the official Codeforces channel in Telegram via the link https://t.me/codeforces_official. ×

Anant2961's blog

By Anant2961, history, 2 months ago, In English

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

Full text and comments »

  • Vote: I like it
  • -3
  • Vote: I do not like it