Aspire Faculty ID #16377 · Topic: NIMCET 2010 · Just now
NIMCET 2010

Given below is a binary tree, where every letter has been coded with a
string of digits 0 and 1. At any node going left is denoted by 1; at any node going right is denoted by 0. Thus
N is denoted as: 10000. All the codes are in Binary notation.
What will be the code for S?

Solution

Trace path from root to S: Right → Right → Left → Left → Left Right = 0, Left = 1 So S = 0 1 1 1 1 = 01111

Previous 10 Questions — NIMCET 2010

Nearest first

Next 10 Questions — NIMCET 2010

Ascending by ID
Ask Your Question or Put Your Review.

loading...