letsbug Solutions

      Hey in the article we are looking at a coding challenge problem. You might have come across this it is called finding the lowest common ancestor in a binary tree.      So we will find the solution to this problem in python. Let's start. The answer is simple we have to visit every node and check if its child is same as it is asked if so then you return the node and we repeat this process for subtrees of  the tree and then if left and right node exit we return it. to the top. code:  class Node :     def __init__ (self,data):         self . data = data         self . left = None         self . right = None class binaryTree :     def __init__ (self):         self . root = None     #inserts a node in binary tree     def insert (self,data):         if ( self . root == None ):     ...

  MCQs On Tree Data - Structure

      Binary Search Tree is a  tree data structure  where binary tree is either empty or non-empty. if it is non-empty then every node contains a key which is distinct and satisfies the following properties: Values less than its parents are places at left side of the parent node. Values greater than its parent are placed at right side of the parent node. The left and right subtree of are given again binary search trees.      In this article we going to implement binary search tree in python language. Binary Search Tree we are going to implement it with linked nodes and not a array.  Binary Search Tree In Python          So first we will create a node class and then a binary tree class. After that we will implement some methods to the binary tree     List of methods that we will implement in the binary tree are : insert  preOrder treversal postOrder treversal inOrder treversal levelOrder treversal heigh...

      Many times we required to have more than two paths from data object  (non-linear) when we have to represent one or many relationship. The best way is to use non-linear data structure.     Tree is a non-linear data structure. Non-linear  data structures are capable of expression more complex relationship than linear data structure. In general, wherever the hierarchical relationship among data is to be preserved tree is used.     Today in this article we are going to implement a basic Binary Search Tree . But before that lets see a binary tree.     What is a Binary Tree?      Binary Tree is a special form of a tree is finite set of nodes, which is either empty or partitioned into three sets, one which is the root and two disjoint binary trees called left subtree and right subtree. It si ...