Shulou(Shulou.com)06/01 Report--

This article will explain in detail how to achieve binary tree search in Java. The content of the article is of high quality, so the editor shares it for you as a reference. I hope you will have a certain understanding of the relevant knowledge after reading this article.

The basic idea of binary tree search is to start from the root node in the binary search tree, if it is larger than the root node, continue to compare the right child, if it is less than, continue to find the left child, and repeat in turn.

As shown in the figure

Input: element to be checked ele

Output: the node position of the corresponding element in the binary search tree

Code:

Public Node search (Object ele) {return binTSearchRe (root, ele);} private Node binTSearchRe (BinTreeNode rt, Object ele) {if (rt==null) return null;switch (strategy.compare (ele,rt.getData () {case 0: return rt; / equal to case-1: return binTSearchRe (rt.getLChild (), ele); / / less than default: return binTSearchRe (rt.getRChild (), ele); / / greater than}}

Input: element to be checked ele

Output: the node position of the corresponding element in the binary search tree

Code:

Public Node search (Object ele) {return binTSearchRe (root, ele);} private Node binTSearchRe (BinTreeNode rt, Object ele) {if (rt==null) return null;switch (strategy.compare (ele,rt.getData () {case 0: return rt; / equal to case-1: return binTSearchRe (rt.getLChild (), ele); / / less than default: return binTSearchRe (rt.getRChild (), ele); / / greater than}}

Enter: root node v

Output: the position of the smallest element in a binary search tree with v as root

Code:

Public Node min (BinTreeNode v) {if (vested null) while (v.hasLChild ()) v = v.getLChild (); return v;}

Enter: root node v

Output: the location of the largest element in a binary search tree with v as root

Code:

Public Node max (BinTreeNode v) {if (vested null) while (v.hasRChild ()) v = v.getRChild (); return v;}

Enter: root node v

Output: returns the subsequent nodes of v in the mid-order traversal sequence

Code:

Private BinTreeNode getSuccessor (BinTreeNode v) {if (v==null) return null;if (v.hasRChild ()) return (BinTreeNode) min (v.getRChild ()); while (v.isRChild ()) v = v.getParent (); return v.getParent ();}

Enter: root node v

Output: returns the precursor node of v in the mid-order traversal sequence

Code:

Private BinTreeNode getPredecessor (BinTreeNode v) {if (v==null) return null;if (v.hasLChild ()) return (BinTreeNode) max (v.getLChild ()); while (v.isLChild ()) v = v.getParent (); return v.getParent ();} on how to achieve binary tree search in Java is shared here. I hope the above content can be helpful to you and learn more knowledge. If you think the article is good, you can share it for more people to see.

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.