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

This article is about how to insert a binary tree in Java. The editor thinks it is very practical, so I share it with you. I hope you can get something after reading this article. Let's take a look at it.

The basic idea of binary tree insertion is to start from the root node, if the element to be inserted is smaller than the root node, then continue to look for the left child node; if it is larger than the root node, continue to look for the right child node. Back and forth in turn.

As shown in the figure:

Input: element to be inserted ele output: insert ele code in the binary search tree: public void insert (Object ele) {BinTreeNode p = null; BinTreeNode current = root;while {/ / find the position to be inserted p = current;if (strategy.compare (ele,current.getData ()

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.