# Programming Data Structure And Algorithms Using Python | Week 7

Session: JULY-DEC 2023

Course Name: Programming Data Structure And Algorithms Using Python

#### These are Programming Data Structure And Algorithms Assignment 7 Answers

Q1. Given the following permutation of a,b,c,d,e,f,g,h,i,j, what is the next permutation in lexicographic (dictionary) order? Write your answer as a sequence of letters without quotes and without any blank spaces between letters.
eibjdhgfca

Q2. We want to add a function listmax() to the class Node that implements user defined lists such that listmax() computes the maximum value in a list where values are of type int.
An incomplete implementation of listmax() given below. You have to provide expressions to put in place of AAA, BBB and CCC.
def listmax(self):
if self.value == None:
return(AAA)
elif self.next == None:
return(BBB)
else:
return(CCC)

AAA: 0, BBB: self.value, CCC: max(self.value, self.next.listmax())
AAA: 0, BBB: self.value, CCC: max(self.value, self.next.value)
AAA: None, BBB: self.value, CCC: max(self.value, self.next.listmax())
AAA: None, BBB: self.value, CCC: max(self.value, self.next.value)

Answer: AAA: None, BBB: self.value, CCC: max(self.value, self.next.listmax())

These are Programming Data Structure And Algorithms Assignment 7 Answers

Q3. Suppose we add this function foo() to the class Tree that implements search trees. For a name mytree with a value of type Tree, what would mytree.foo() compute?
def foo(self):
if self.isempty():
return(0)
elif self.isleaf():
return(1)
else:
return(self.left.foo() + self.right.foo())

The number of nodes in mytree
The largest value in mytree.
The length of the longest path from root to leaf in mytree.
The number of leaves in mytree.

Answer: The number of leaves in mytree.

Q4. Inorder traversal of a binary tree has been defined in the lectures. A postorder traversal lists the vertices of a binary tree (not necessarily a search tree) as follows:
Print the left subtree in postorder.
Print the right subtree in postorder.
Print the root.
Suppose we have a binary tree with 10 nodes labelled a, b, c, d, e, f, g, h, i, j, with postorder traversal ehicbjfadg and inorder traversal ehbicgjafd. What is the left child of the root node? (Write your answer as a single letter, without quotes.)

These are Programming Data Structure And Algorithms Assignment 7 Answers

More Weeks of Programming Data Structure And Algorithms Using Python: Click here

Session: JAN-APR 2023

Course Name: Programming Data Structure And Algorithms Using Python

Quiz

#### Q1. Given the following permutation of a,b,c,d,e,f,g,h,i,j, what is the previous permutation in lexicographic (dictionary) order? Write your answer without any blank spaces between letters.

``ghadbicefj``

Q2. We want to add a function listmin() to the class Node that implements user defined lists such that listmin() computes the minimum value in a list of values of type int.
An incomplete implementation of listmin() given below. You have to provide expressions to put in place of AAA, BBB and CCC.

``````def listmin(self):
if self.value == None:
return(AAA)
elif self.next == None:
return(BBB)
else:
return(CCC)``````

a. AAA: 0, BBB: self.value, CCC: min(self.value, self.next.listmin())
b. AAA: 0, BBB: self.value, CCC: min(self.value, self.next.value)
c. AAA: None, BBB: self.value, CCC: min(self.value, self.next.listmin())
d. AAA: None, BBB: self.value, CCC: min(self.value, self.next.value)

Answer: c. AAA: None, BBB: self.value, CCC: min(self.value, self.next.listmin())

These are Programming Data Structure And Algorithms Assignment 7 Answers

Q3. Suppose we add this function foo() to the class Tree that implements search trees. For a name mytree with a value of type Tree, what would mytree.foo() compute?

``````def foo(self):
if self.isempty():
return(0)
elif self.isleaf():
return(1)
else:
return(self.left.foo() + self.right.foo())``````

a. The sum of the elements in the tree
b. The maximum sum across all root to leaf paths in the tree
c. The length of the longest root to leaf path in the tree
d. The number of root to leaf paths in the tree.

Answer: d. The number of root to leaf paths in the tree.

Q4. The postorder traversal of a binary search tree with integer values produces the following sequence: 22, 38, 28, 49, 48, 58, 61, 52, 45. What is the value of the left child of the root of the tree?
a. 22
b. 28
c. 38
d. 52

These are Programming Data Structure And Algorithms Assignment 7 Answers

More Nptel courses: https://progiez.com/nptel

Session: JULY-DEC 2022

Course Name: Programming Data Structure And Algorithms Using Python

#### These are Programming Data Structure And Algorithms Assignment 7 Answers

Q1) Given the following permutation of a, b, c, d, e, f, g, h, i, j, what is the next permutation in lexicographic (dictionary) order? Write your answer without any blank spaces between letters.

``'fjadcbeghi'``

These are Programming Data Structure And Algorithms Assignment 7 Answers

Q2) We want to add a function length() to the class Node that implements user defined lists which will compute the length of a list. An incomplete implementation of length() given below. You have to provide expressions to put in place of XXX, YYY. and ZZZ.
XXX : 0, YYY : 0, ZZZ : self.next.length()
XXX : 0, YYY : 0, ZZZ : 1+ self.next.length()
XXX : 0, YYY : 1, ZZZ : self.next.length()
XXX : 0, YYY : 1, ZZZ : 1+ self.next.length()

Answer: XXX : 0, YYY : 1, ZZZ : 1+ self.next.length()

These are Programming Data Structure And Algorithms Assignment 7 Answers

Q3) Suppose we add this function foo() to the class Tree that implements search trees. For a name mytree with a value of type Tree, what would mytree.foo () compute?
The number of nodes in mytree.
The largest value in mytree.
The length of the longest path from root to leaf in mytree.
The number of paths in mytree.

Answer: The length of the longest path from root to leaf in mytree.

These are Programming Data Structure And Algorithms Assignment 7 Answers

4) Inorder traversal of a binary tree has been defined in the lectures. A preorder traversal lists the vertices of a binary tree (not necessarily a search tree) as follows :
• Print the root.
• Print the left subtree in preorder.
• Print the right subtree in preorder.
Suppose we have a binary tree with 10 nodes labelled a, b, c, d, e, f, g, h, i, j, with preorder traversal gbhecidajf and inorder traversal ehbicgjafd. What is the right child of the root node?

``'d'``