Revision as of 23:34, 23 January 2023 edit Rory O'Kane (talk \| contribs) Extended confirmed users 508 edits →Arbitrary trees: optional → optimal Tag: Reverted ← Previous edit		Revision as of 16:23, 24 January 2023 edit undo Jochen Burghardt (talk \| contribs) Extended confirmed users 24,305 edits Undid revision 1135319353 by Rory O'Kane (talk): no, "optional" (i.e. "can be omitted") was right Tag: Undo Next edit →
Line 83: # Visit the current node for post-order traversal. Depending on the problem at hand, pre-order, post-order, and especially one of the number of subtrees − 1 in-order operations may be ~~optimal~~optional. Also, in practice more than one of pre-order, post-order, and in-order operations may be required. For example, when inserting into a ternary tree, a pre-order operation is performed by comparing items. A post-order operation may be needed afterwards to re-balance the tree. ===Breadth-first search===

Tree traversal: Difference between revisions