A tree is a fundamental structure in Computer Science. Almost all operating systems store files in trees or tree-like structures. It is well known that given the in-order traverse of a binary tree, along with one of its pre-order or post-order traversals, the original binary tree can be uniquely identified. It is not difficult to write a recursive algorithm to reconstruct the binary tree. Most textbooks and reference books present the recursive and non-recursive algorithms for traversing a binary tree in in-order, post-order and pre-order. Many reconstruction algorithms for binary tree have been discussed in this book.
| Autorius: | Nitin Arora |
| Leidėjas: | LAP LAMBERT Academic Publishing |
| Išleidimo metai: | 2018 |
| Knygos puslapių skaičius: | 60 |
| ISBN-10: | 6139835720 |
| ISBN-13: | 9786139835720 |
| Formatas: | Knyga minkštu viršeliu |
| Kalba: | Anglų |
| Žanras: | Calculus and mathematical analysis |
Parašykite atsiliepimą apie „Non-Recursive Approach for Reconstructing a Binary Tree“
