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
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3845 |
| 2 | jiangly | 3707 |
| 3 | Benq | 3630 |
| 4 | orzdevinwang | 3573 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | jqdai0815 | 3532 |
| 8 | ecnerwala | 3501 |
| 9 | gyh20 | 3447 |
| 10 | Rebelz | 3409 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 171 |
| 2 | adamant | 163 |
| 3 | awoo | 161 |
| 4 | nor | 152 |
| 5 | maroonrk | 151 |
| 5 | -is-this-fft- | 151 |
| 7 | TheScrasse | 148 |
| 8 | atcoder_official | 146 |
| 9 | Petr | 145 |
| 10 | pajenegod | 144 |
→ Find user
→ Recent actions
Is there any way to get inorder preorder postorder of this tree?? using dfs or bfs
Revision en1, by Anant2961, 2024-05-18 10:38:47
History
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Jun/26/2024 11:55:47 (g1).
Desktop version, switch to mobile version.
Supported by
