✦ LIBER ✦

On the recursion depth of special tree traversal algorithms

✍ Scribed by Peter Kirschenhofer; Helmut Prodinger

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of algorithms on recur

✍ Jerzy Szymański 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 476 KB

Linear algorithms on recursive represent

✍ S.L. Mitchell; E.J. Cockayne; S.T. Hedetniemi 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 623 KB

On the existence of special depth first

✍ Ephraim Korach; Zvi Ostfeld 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 641 KB

On the space complexity of recursive alg

✍ Eitan M. Gurari; Oscar H. Ibarra 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 769 KB

A note on the reconstruction of a binary

✍ Naveen Gabrani; Priti Shankar 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 240 KB

On the independent spanning trees of rec

✍ Jinn-Shyong Yang; Jou-Ming Chang; Shyue-Ming Tang; Yue-Li Wang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 895 KB