Trees – Let us code

Path length between two binary tree nodes

January 23, 2017adminLeave a comment

Given a full binary tree (all nodes except leaf nodes have left and right child) represented as shown below. If the root is labelled i, it’s left child is labelled 2*i and right child is labelled as 2*i+1. 1 / \ 2 3 / \ / \ 4 5 6 7 Given two nodes from…

Finding the depth of n-ary tree given parent id representation

August 26, 2014adminLeave a comment

Given an a rooted n-ary tree represented as a parent id array, Write a program to find the depth of it. The depth of a tree is defined as the maximum length of the path from root to any leaf node. For example the following tree has a depth of 2 (for the path 0-2-4) It…