Free delivery for orders over 69.99 euro.

Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Free delivery for purchases over 69.99 €

DPD courier 5.99 € Bpost point 7.99 € Bpost 7.49 € DPD point 3.49 € GLS courier 4.49 €

Contact

How to shop

Help

My account

▸ Empty :-(

Free delivery for orders over 69.99 euro.

Non-Recursive Approach for Reconstructing a Binary Tree

Name: Non-Recursive Approach for Reconstructing a Binary Tree
Brand: LAP Lambert Academic Publishing
SKU: 19688369
Price: 32.1 EUR
Availability: InStock
Author: Nitin Arora
ISBN: 9786139835720

Nitin Arora

Language

English

Book Paperback

Libristo code: 19688369

Publishers LAP Lambert Academic Publishing, November 2017

A tree is a fundamental structure in Computer Science. Almost all operating systems store files in t... Full description

Libristo code: 19688369

78 b

32.10 €

In stock at our supplier Shipping in 8-11 days

30-day return policy

Customers also purchased

L'entretien d'embauche en 202 questions toutes les bonnes réponses pour décrocher le job Daniel Porot

Paperback

24.10 €

Zrozumieć BPMN. Modelowanie procesów biznesowych wyd. 2 Szymon Drejewicz

Paperback

13.16 €

Kompetenzfoerderung und Weiterbildung in der psychiatrischen Pflege. Eine Betrachtung aus bildungswissenschaftlicher Sicht Daniela Rupprecht

Paperback

16.20 €

J.C. - Agent im Fadenkreuz Joe Craig

Paperback

9.71 €

Begegnungen mit Migration. Ein Beitrag zur interkulturellen Kommunikation Tanja Schmidt

Paperback

26.42 €

El marxismo de Marx Lacasta

Paperback

18.83 €

Elogio della follia. Testo latino a fronte Erasmo da Rotterdam

Book

15.79 €

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.