Three types of traversal code:
function inorder (node) {//middle order traversal if (node!=null) {inorder (node.left);d Ocument.write (node.show () + ""); Inorder ( node.right);}} function preorder (node) {///ordinal traversal if (node!=null) {document.write (node.show () + "");p reorder (node.left);p Reorder ( node.right);}} function postorder (node) {//post-traversal if (node!=null) {postorder (node.left);p Ostorder (node.right);d Ocument.write ( Node.show () + "");}}
And finally the experiment Code:
var nums=new BST (Nums.insert); nums.insert; Nums.insert (+); Nums.insert (PNS); Nums.insert (3); Nums.insert (99 ); nums.insert; inorder (Nums.root),//3 ("<br>");p 99document.write (reorder) nums.root 16 3 22 99document.write ("<br>");p Ostorder (nums.root);//3 22 16 37 99 45 23
The structure of the tree is:
23
16 45
3 22 37 99
The corresponding first order, the middle order, the sequence result self-derivation.
Binary Tree Traversal javascript