This is a Python program to find the number of nodes in a binary tree. Problem Description The program creates a binary tree and counts the number of nodes in the tree. Problem Solution 1. Create a class BinaryTree with instance variables key, left and right. 2. Define methods set_root, insert_left, insert_right, inorder and search. … Read more
This is a Python program to count the number of leaf nodes in a tree. Problem Description The program creates a tree and counts the number of leaf nodes in the tree. Problem Solution 1. Create a class Tree with instance variables key and children. 2. Define methods set_root, add, count_leaf_nodes, count_leaf_nodes_helper and search. 3. … Read more
This is a Python program to find the smallest and largest elements in a binary search tree. Problem Description The program presents a menu to the user to perform various operations on a binary search tree including finding the smallest and largest elements. Problem Solution 1. Create a class BSTNode with instance variables key, left, … Read more
This is a Python program to construct a binary search tree and perform deletion and inorder traversal. Problem Description The program creates a binary search tree and presents a menu to the user to perform insertion, deletion and inorder traversal operations. Problem Solution 1. Create a class BSTNode with instance variables key, left, right and … Read more
This is a Python program to build a binary tree with in-order and post-order traversals as input. Problem Description The program builds a binary tree from their in-order and post-order traversals. Problem Solution 1. Create a class BinaryTree with instance variables key, left and right. 2. Define methods set_root, inorder, and postorder. 3. The method … Read more
This is a Python program to create a mirror copy of a binary tree and display its BFS traversal. Problem Description The program creates a mirror copy of a binary tree and displays its BFS traversal. Problem Solution 1. Create a class BinaryTree with instance variables key, left and right. 2. Define methods set_root, insert_left, … Read more
This is a Python program to perform depth-first post-order traversal on a tree. Problem Description The program creates a tree and presents a menu to the user to perform operations on the tree including post-order traversal. Problem Solution 1. Create a class Tree with instance variables key and children. 2. Define methods set_root, add, postorder … Read more
This is a Python program to find the largest value of a binary tree using in-order traversal. Problem Description The program creates a binary tree and presents a menu to the user to perform operations on the tree including finding the largest element in the tree. Problem Solution 1. Create a class BinaryTree with instance … Read more
This is a Python program to find the Nth node in the in-order traversal of a binary tree. Problem Description The program creates a binary tree and presents a menu to the user to perform operations on the tree including printing the Nth term in its in-order traversal. Problem Solution 1. Create a class BinaryTree … Read more
This is a Python program to perform depth-first search on a binary tree without using recursion. Problem Description The program creates a binary tree and presents a menu to the user to perform operations on the tree including depth-first search. Problem Solution 1. Create a class Stack to implement a stack. 2. The class Stack … Read more
