undefined | Better HN

0 pointskristov3y ago0 comments

Is there a practical reason to do this in a real-world program?

0 comments

2 comments · 1 top-level

saagarjha3y ago· 1 in thread

Sure, it’s the binary tree equivalent of reversing an array.

For large enough trees it's probably more efficient to instead just switch from preorder to postorder traversal instead of changing the whole tree.

j / k navigate · click thread line to collapse