[Javase] Data structure (binary tree-traversal and lookup)

Pre-sequence traversal: Middle, left, right

Middle sequence traversal: Left, middle, right

Post-post traversal: Left, right, middle

Binary Tree Lookup

Compare from root node, target is smaller than root node, pointer moves to left

Compare from the root node, the target is larger than the root node, and the pointer moves to the right

    /*** Pre-order traversal *@paramTree*/     Public voidPreorder (Bstree tree) {preorder (tree.mroot); }     Public voidPreorder (Bstnode node) {if(node!=NULL) {System.out.print (Node.key+"");            Preorder (Node.left);        Preorder (node.right); }    }    /*** Middle Sequence traversal *@paramTree*/     Public voidmidorder (Bstree tree) {Midorder (tree.mroot); }     Public voidMidorder (Bstnode node) {if(node!=NULL) {midorder (node.left); System.out.print (Node.key+"");        Midorder (Node.right); }    }    /*** Post-post traversal *@paramTree*/     Public voidpostorder (Bstree tree) {postorder (tree.mroot); }     Public voidPostorder (Bstnode node) {if(node!=NULL) {postorder (node.left);            Postorder (Node.right); System.out.print (Node.key+""); }    }    /*** Binary Tree search *@paramTree *@paramKey *@return     */     PublicBstnode<t> Search (bstree<t>tree,t Key) {Bstnode<T> mroot=Tree.mroot;  while(mroot!=NULL){            intflag=Key.compareto (Mroot.key); if(flag<0) {Mroot=Mroot.left; }Else if(flag>0) {Mroot=Mroot.right; }Else{                returnMroot; }        }        returnMroot; }

        Tree.preorder (tree); // Output 312546        Tree.midorder (tree); // output 123456        Tree.postorder (tree); // Output 214653        Bstree.bstnode Node=tree.search (tree, 5);        System.out.println (Node.left.key); // Output 4

[Javase] Data structure (binary tree-traversal and lookup)