pub struct PostOrder;Expand description
Post-order traversal algorithm.
Visits children before their parent. Useful for bottom-up processing where you need to process all descendants before the node itself.
Visit order: Left subtree → Right subtree → Root
Trait Implementations§
Auto Trait Implementations§
impl Freeze for PostOrder
impl RefUnwindSafe for PostOrder
impl Send for PostOrder
impl Sync for PostOrder
impl Unpin for PostOrder
impl UnsafeUnpin for PostOrder
impl UnwindSafe for PostOrder
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more