RePublic of CS
  • INFO
    • ❔What is RePublic of CS?
    • 🗺️RCS Open Course
    • 🏛️RCS Classroom
    • 👩‍🌾RCS Forum (soon)
    • 🌟RCS Mentors
    • 🙋如何參與學習？
      • ⏳RCS.101 x Miters (24 Q2)
  • ⚒️RCS.101
    • § DSA In Action
    • RCS.101.a
    • RCS.101.b
    • RCS.101.c
    • RCS.101.d
    • ¶ Graduation
      • Apx: BFS/Shortest Path
      • Apx: Classic Applications
      • Apx: Techniques & Tricks
      • Apx: Morris Traversal
      • Apx: RCS.101 x Miters W6
      • Apx: In-place Merge Sort
  • 📚RCS.102
    • § Algorithm Design & Analysis
    • ⌛ Divide & Conquer
    • ⌛ Recursion
  • 🧵RCS.103
    • § SYS/PARL Programming
  • 🦀RCS.201
    • § Rust
  • 🧱RCS.301
    • § Software Architecture
  • 🏰RCS.302
    • § Web System Design
  • 📣MEDIA
    • YouTube
    • Twitch
    • Threads
    • Discord Forum
    • Become an Editor
    • Resources
  • 📜Articles
    • System Design, Actually
Powered by GitBook
On this page
  1. RCS.101
  2. ¶ Graduation

Apx: Morris Traversal

PreviousApx: Techniques & TricksNextApx: RCS.101 x Miters W6

Last updated 1 year ago

A 3rd way the traverse a binary tree other than stack or recursion

  • Learning Material

  • Practices

解法三 Morris Traversal
CPP Morris Traversal
L37. Morris Traversal | Preorder | Inorder | C++ | Java
114. Flatten Binary Tree to Linked List
915 · Inorder Predecessor in BST
430. Flatten a Multilevel Doubly Linked List
⚒️
Page cover image