pub struct PreOrder;Expand description
Pre-order traversal algorithm.
Visits parent nodes before their children. Useful for top-down processing where you need to process a node before its descendants.
Visit order: Root → Left subtree → Right subtree
Trait Implementations§
Auto Trait Implementations§
impl Freeze for PreOrder
impl RefUnwindSafe for PreOrder
impl Send for PreOrder
impl Sync for PreOrder
impl Unpin for PreOrder
impl UnsafeUnpin for PreOrder
impl UnwindSafe for PreOrder
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