Answered step by step
Verified Expert Solution
Question
1 Approved Answer
Problem Statement Let us consider a full binary tree. The root is labelled 1 . For every node labelled s, its left child will be
Problem Statement Let us consider a full binary tree. The root is labelled 1 . For every node labelled s, its left child will be labelled 2 s and its right child will be labelled 2s+1. You are given a space. separated input of the form ij. Print the length of the shortest path between node labelled i and node labelled j. Input : First line contains N, the number of queries. Each query consists of two space separated integers i and j in one line. Output : For each query, print the required answer in one line. Note: The Length of the path will always be positive. Example 1: Input: 12 Output: 1 Example 2: Input : 314 Output : 2
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started