What if your binary tree holds hidden treasures, even gems waiting to be discovered? Imagine finding all the even-numbered nodes, regardless of their position, and storing them in a list for easy access. <\/p>\n\n\n\n
This blog takes you on an engaging journey where Python becomes your trusty sidekick to unearth these even gems within a binary tree. Let’s dive into the quest!<\/p>\n\n\n\n
Before we dive into finding the even-numbered nodes, let’s set up our binary tree as specified in the problem statement. The code for the Binary tree is as follows : <\/p>\n\n\n\n
\"\"\"\nUsing Python write a python to Create a Binary Tree whose Root Node is 252.\nUnder Root Node there will be two child nodes 21 and 56.\nNow, insert node 49 and 98 inside node 21 and 189 and 1 inside node 56.\nUnder node 1 insert node 22 and 41 and under node 49 insert node 102 and 103.\nFind all the EVEN number nodes and save it inside a list\nwhether it is present in left side or right side from the binary tree.\n\"\"\"\n\n\nclass Node:\n def __init__(self, val):\n self.val = val\n self.right = None\n self.left = None\n\n\nclass SumanBinaryTree:\n def __init__(self):\n self.root = None\n\n\n def insert_node(self, data):\n if self.root is None:\n self.root = Node(data)\n else:\n self.__insert__recursive(self.root, data)\n\n\n def __insert__recursive(self, node, data):\n if data < node.val:\n if node.left is None:\n node.left = Node(data)\n else:\n self.__insert__recursive(node.left, data)\n else:\n if node.right is None:\n node.right = Node(data)\n else:\n self.__insert__recursive(node.right, data)\n\n\n def print_tree(self, node, level=0):\n if node is not None:\n self.print_tree(node.right, level + 1)\n print(' ' * 4 * level + '->', node.val)\n self.print_tree(node.left, level + 1)\n\n\n def find_even_nodes(self, node, even_nodes):\n if node is not None:\n if node.val % 2 == 0:\n even_nodes.append(node.val)\n self.find_even_nodes(node.left, even_nodes)\n self.find_even_nodes(node.right, even_nodes)\n\n\n# Create the binary tree\ntree = SumanBinaryTree()\ntree.insert_node(252)\ntree.insert_node(21)\ntree.insert_node(56)\ntree.insert_node(49)\ntree.insert_node(98)\ntree.insert_node(189)\ntree.insert_node(1)\ntree.insert_node(22)\ntree.insert_node(41)\ntree.insert_node(102)\ntree.insert_node(103)\n\n\n# Find even nodes\neven_nodes = []\ntree.find_even_nodes(tree.root, even_nodes)\n\n\nprint(\"Even nodes:\", even_nodes)\n<\/code><\/pre>\n\n\n\nStep 1: Define the Node Class<\/strong><\/h3>\n\n\n\nThe Node class represents a single node in our binary tree.<\/p>\n\n\n\n
\n- __init__ method:<\/strong> The constructor initializes a node with a value (val) and sets the left and right children to None.<\/li>\n<\/ul>\n\n\n\n
Step 2: Define the SumanBinaryTree Class<\/strong><\/h3>\n\n\n\nThe SumanBinaryTree class represents the binary tree and contains methods to insert nodes, print the tree, and find even nodes.<\/p>\n\n\n\n
\n- __init__ method:<\/strong> Initializes the root of the tree to None.<\/li>\n\n\n\n
- insert_node method:<\/strong> Inserts a new node into the tree. If the tree is empty (root is None), it creates the root node. Otherwise, it calls the private method __insert__recursive to insert the node recursively.<\/li>\n<\/ul>\n\n\n\n
Recursive Insertion<\/strong><\/h2>\n\n\n\nThe __insert__recursive method handles the recursive insertion of nodes.<\/p>\n\n\n\n
If the data is less than the current node’s value (node.val), it attempts to insert it into the left subtree. If the left child is None, it creates a new node there. Otherwise, it recurses into the left child.<\/p>\n\n\n\n
Similarly, if the data is greater than or equal to the current node’s value, it follows the same logic for the right subtree.<\/p>\n\n\n\n
Ready to master Python and unlock endless career opportunities in tech? HCL GUVI\u2019s Python Course<\/a><\/strong> is designed for learners of all levels, offering a comprehensive curriculum, hands-on projects, and expert mentorship. This course is designed to equip you with the knowledge and tools to excel in fields like AI, Data Science, and Web Development. Take the first step towards transforming your career with Python!<\/em><\/p>\n\n\n\nConclusion<\/strong><\/h2>\n\n\n\nThrough this exploration, we\u2019ve built a binary tree, traversed its depths, and uncovered its hidden treasures: the even-numbered nodes. By combining recursive functions and Python<\/a>‘s versatility, you now have a powerful method to extract these “gems” effortlessly. <\/p>\n\n\n\n