<Li> Let N be the number of non-self - crossing paths for moving a tower of h disks from one peg to another one . Then: <Ul> <Li> N = 2 </Li> <Li> N = (N) + (N). </Li> </Ul> </Li> <Ul> <Li> N = 2 </Li> <Li> N = (N) + (N). </Li> </Ul> <Li> N = 2 </Li> <Li> N = (N) + (N). </Li>

What is tower of hanoi problem in data structure