English | 简体中文 | 繁體中文 | Русский язык | Français | Español | Português | Deutsch | 日本語 | 한국어 | Italiano | بالعربية
Dans cet exemple, nous allons apprendre à implémenter la structure de données d'arbre binaire en Java.
//Créer la classe de nœud class Node { int key; Node left, right; public Node(int item) { key = item; left = right = null; } } class BinaryTree { Node root; //Parcourir l'arbre public void traverseTree(Node node) { if (node != null) { traverseTree(node.left); System.out.print("\xe3\x80\x82" + node.key); traverseTree(node.right); } } public static void main(String[] args) { //Create BinaryTree object BinaryTree tree = new BinaryTree(); //Create tree nodes tree.root = new Node(1); tree.root.left = new Node(2); tree.root.right = new Node(3); tree.root.left.left = new Node(4); System.out.print("\nBinary tree: \t"); tree.traverseTree(tree.root); } }
Output result
Binary tree: 4 2 1 3
In the above example, we have implemented the binary tree in Java. Unlike other data structures, Java does not provide an embedded class for trees.
Here, we have created our own class BinaryTree.