alternate solution ( i think this is the python way)

[dubeyji10]

n = eval(input(""))
if n>15:
for i in range(0,n+1):
print("{:5b}".format(i))
else:
for i in range(0,n+1):
print("{:4b}".format(i))

indentation not visible in issue?

though it passed all the test cases it could be improved

[amirkhan1092]

i appreciated your logic for the binary burj tree. try to make it with all numbers

n = eval(input(""))
if n>15:
    for i in range(0,n+1):
        print("{:5b}".format(i))
else:
    for i in range(0,n+1):
        print("{:4b}".format(i))

10
   0
   1
  10
  11
 100
 101
 110
 111
1000
1001
1010

[247software-manvendra-singh]

a=int(input())
b=len(bin(a)[2:])
for i in range(a+1):
l=bin(i)
c=len(l[2:])
print(" "*(b-c)+str(l[2:]))

#this for the all number sir