Beschreibung
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.
Autorenporträt
Mr. Nitin Arora is currently working as Assistant Professor (SS ) in the SCS, UPES, Dehradun. He received his M. Tech. in CSE from GBPEC, Pauri. He is a member of various professional societies. His current research interest includes algorithm design and image processing. He has published many research papers in International Journals
Herstellerkennzeichnung:
BoD - Books on Demand
In de Tarpen 42
22848 Norderstedt
DE
E-Mail: info@bod.de
