Tag Archives: Binary tree

Binary Search Trees from keys 1 to n

Construct Binary Search Trees from keys 1 to n Problem statement to construct a Binary Search Tree(BST) from keys 1 to n. We are given a list of consecutive numbers from 1 to . Determine the number of binary trees that can be constructed from these numbers. Example for building a Binary Search Tree from keys… Read More »

Sorted Linked List to balanced Binary Search Tree

Sorted Linked List to balanced Binary Search Tree (BST). Problem statement to create a Binary Search Tree from a sorted linked list. Given a singly linked list in a sorted order, create a balanced binary search tree (BST). Example: INPUT: Linked List: 1->5->8->10->12->15->20 OUTUT: 10 / \ 5 15 / \ / \ 1 8 12 20 Create… Read More »

Print common nodes in two Binary Search Trees

Print common nodes in two Binary Search Trees Problem statement to print common nodes in two Binary Search Trees (BST). Given two binary search trees, print all the elements that are common in both the trees. Example: INPUT:Tree 1 10 / \ 5 15 / \ / \ 1 8 12 20 Tree 2 7… Read More »

Create a BST such that sum of all greater keys is added to its every key

Create a BST such  that sum of all greater keys is added to its every key. Problem statement to construct a Binary Search Tree (BST) such  that sum of all greater keys is added to its every key: Given a balanced binary search tree (BST), build a binary search tree such that all nodes in original… Read More »

Check identical Binary Search Tree (BST)

Check identical Binary Search Tree (BST) without building a tree Problem statement to check identical Binary Search Tree (BSTs) without building a tree. We are given two arrays of integers from each of which we have to make a binary search tree(BST). We need to determine whether these binary search trees (BSTs) will be identical… Read More »

Handshaking Lemma and Trees

Handshaking Lemma and Trees What is Handshaking Lemma? Degree of a vertex is number of edges incident on it. Handshaking Lemma states that, in every finite undirected graph, number of vertices with odd degree is always even. The handshaking lemma is a consequence of the degree sum formula: The vertices of odd degree in a… Read More »

Binary Tree and its Properties

Binary Tree and its Properties Following are some properties of binary trees. The maximum number of nodes at a given level, k of a binary tree is 2k-1. Level of root is taken to be 1 above. This can be proved by induction. For root, k = 1 Therefore, number of nodes = 2k-1 = 1… Read More »

Binary Tree Introduction

Introduction to Binary Tree Trees are hierarchical data structures. The topmost node is called root of the tree. The elements that are directly under an element are called its children. The element directly above something is called its parent. Elements with no children are called leaf nodes or leaves. A tree whose elements have at most 2… Read More »

Check if a Binary Tree is BST or not

Check if a Binary Tree is BST or not Given a Binary Tree, we need to print the level of a given data/node in the Binary Tree, or print a statement to tell it is absent from the tree in case it is not present. Check if a Binary Tree is BST or not Example:… Read More »

Level of a Given Node

Finding Level of a Given Node in a Binary Tree. Given a Binary Tree, we need to print the level of a given data/node in the Binary Tree, or print a statement to tell it is absent from the tree in case it is not present. Level of a Given Node in a Binary Tree… Read More »