Aspire's Library
A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations - NIMCET
Study Stuff for MCA Examinations - NIMCET
Previous Year Question (PYQs)
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 = 01111Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
Ask Your Question or Put Your Review.
