Lecture 172:- Trees Class - 2

Of course! Let's dive deeper into a more advanced tree class implementation. In this example, I'll demonstrate the creation of a Binary Tree class along with common tree traversal methods like in-order, pre-order, and post-order traversals.

pythonCopy code

class TreeNode: def __init__(self, data): self.data = data self.left = None self.right = None class BinaryTree: def __init__(self, root_data): self.root = TreeNode(root_data) def insert(self, data): self._insert_recursively(self.root, data) def _insert_recursively(self, node, data): if data < node.data: if node.left is None: node.left = TreeNode(data) else: self._insert_recursively(node.left, data) elif data > node.data: if node.right is None: node.right = TreeNode(data) else: self._insert_recursively(node.right, data) def in_order_traversal(self, node): if node: self.in_order_traversal(node.left) print(node.data, end=" ") self.in_order_traversal(node.right) def pre_order_traversal(self, node): if node: print(node.data, end=" ") self.pre_order_traversal(node.left) self.pre_order_traversal(node.right) def post_order_traversal(self, node): if node: self.post_order_traversal(node.left) self.post_order_traversal(node.right) print(node.data, end=" ") # Example usage tree = BinaryTree(10) tree.insert(5) tree.insert(15) tree.insert(3) tree.insert(7) tree.insert(12) tree.insert(18) print("In-order traversal:") tree.in_order_traversal(tree.root) print("\nPre-order traversal:") tree.pre_order_traversal(tree.root) print("\nPost-order traversal:") tree.post_order_traversal(tree.root)

In this example, we've defined two classes: TreeNode and BinaryTree. The TreeNode class represents individual nodes in the tree, with references to their left and right children. The BinaryTree class contains methods for inserting elements and performing different types of tree traversals.

The insert method is used to insert data into the binary tree. The _insert_recursively method is a helper method that recursively navigates the tree to find the appropriate position for insertion.

The in_order_traversal, pre_order_traversal, and post_order_traversal methods implement the respective traversal algorithms. These traversal methods visit the nodes of the tree in a specific order and print their data.

This example demonstrates a simple binary tree and its traversal methods. Binary trees are just one type of tree structure, and you can further explore other types of trees, such as binary search trees, AVL trees, and more complex tree-related algorithms and data structures.