Non-Recursive Approach for Reconstructing a Binary Tree - Nitin Arora
-25% koodilla BOOKS
Toimitus 15-21 arkipäivässä
30 päivän palautusoikeus
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 ... Täydellinen kuvaus
Saatat myös pitää
Kuvaus
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.
Lisätietoja
| Kirjoittaja | Nitin Arora |
|---|---|
| Julkaisija | LAP LAMBERT Academic Publishing |
| Julkaisuvuosi | 2018 |
| Kannen tyyppi | Pehmeäkantinen |
| EAN | 9786139835720 |