Binary Tree

Binary Tree¶

Inorder¶

In-order: left child → parent → right child

[10, 14, 19, 27, 31, 35, 42]

Preorder¶

Pre-order: parent → left child → right child
[27, 14, 10, 19, 35, 31, 42]

Postorder¶

Post-order: left child → right child → parent

[10, 19, 14, 31, 42, 35, 27]

참고 문서¶

• Depth-First Search of a Binary Tree in JavaScript | by Yogi Paturu | Bits and Pieces