java怎么实现简单的二叉树

57次阅读

共计 1568 个字符，预计需要花费 4 分钟才能阅读完成。

要在 Java 中实现简单的二叉树，你可以创建一个名为 BinaryTree 的类，其中包含一个名为 Node 的内部类，表示二叉树的节点。

public class BinaryTree {private Node root;
    
    private class Node {private int data;
        private Node left;
        private Node right;
        
        public Node(int data) {this.data = data;
            this.left = null;
            this.right = null;
        }
    }
    
    public BinaryTree() {root = null;
    }
    
    public void insert(int data) {root = insert(root, data);
    }
    
    private Node insert(Node node, int data) {if (node == null) {node = new Node(data);
        } else {if (data <= node.data) {node.left = insert(node.left, data);
            } else {node.right = insert(node.right, data);
            }
        }
        return node;
    }
    
    public boolean search(int data) {return search(root, data);
    }
    
    private boolean search(Node node, int data) {if (node == null) {return false;
        }
        if (data == node.data) {return true;
        } else if (data < node.data) {return search(node.left, data);
        } else {return search(node.right, data);
        }
    }
    
    public void inorderTraversal() {inorderTraversal(root);
    }
    
    private void inorderTraversal(Node node) {if (node != null) {inorderTraversal(node.left);
            System.out.print(node.data + " ");
            inorderTraversal(node.right);
        }
    }
    
    public static void main(String[] args) {BinaryTree tree = new BinaryTree();
        tree.insert(10);
        tree.insert(5);
        tree.insert(15);
        tree.insert(3);
        tree.insert(7);
        
        System.out.println("Inorder traversal:");
        tree.inorderTraversal();
        
        int searchData = 7;
        System.out.println("\nIs " + searchData + " present in the tree? " + tree.search(searchData));
    }
}