In PreOrder traversal, the root is visited first, followed by left subtree and the right subtree, hence it is also known as NLR (nod-left-right) algorithm ...
確定! 回上一頁