₦airaland Forum

Karleb:
Binary Search Trees are always balanced!


Binary trees don't always have to be balanced and I guess in such case the tree transversal is the correct way of getting the deepest value.

The tree in the question is a binary tree not a binary search tree.

           1
              \
                 2
                   \
                      3
                        \
                           4
                             \
                                5

             3
           /     \
         1        4
           \        \
              2       5

Karleb:
Transversal means visiting all nodes. That is, breath first search or depth first search.

Finding the minimum value on a binary search tree should not require that, since we know that the smallest value will always be on the far left of the tree and of course the highest will be on the far right.

So we run a while loop to check if the left node of a particular node is null starting from the root node, the loop will return the node that has no left node.

In this BST the loop will go from 50 to 17 to 12 to 9 and will return 9 since 9 has no left node.

Karleb:
That's right.

But in the question, the value at the deepest level is the minimum. So finding the minimum value of that particular BST would solve the problem.

vheckthor1:
this is a Depth first search algorithm

Karleb:
No. It's finding the smallest value of the tree.

The tree transversal will be quite unnecessary.

                  10
                  /      \
                5         17
              /   \
             3      8
                   /    \
                 7       9

Karleb:
How about this one?

 def spiralPrinting(anArr):
 	rootList = []
 	def inner(arr):
 		rootList.extend(arr[0])
 		arr.pop(0)
 		for each in arr:
 			rootList.append(each.pop())
 		arr[-1].reverse()
 		rootList.extend(arr.pop())
 		if len(arr) > 0:
 			for x in range(len(arr) -1, -1, -1):
 				rootList.append(arr[x].pop(0))
 		if len(arr) > 1:
 			inner(arr)
 		else:
 			if len(arr) > 0:
 				rootList.extend(arr.pop())
			
 	inner(anArr)
 	return rootList
 if __name__ == '__main__':
 	multi = [[1,2,3,4,5],
 	           [6,7,8,9,10],
 	           [11,12,13,14,15],
 	           [16,17,18,19,20]]
 	print(spiralPrinting(multi))






 

IamGoke:
If you are writing code, you need to format your text in code format.

[Code]

#Your code here

[/Code]

Change the C to c

Example below:

 print('hello word')

 def appreciation():
       print("Thanks bro" )

Jummate:
def product(m, n):

if n == 0:

return 0

else:

return m + product(m, n-1)

gbolly1151:
Give a recursive algorithm to compute the product of two positive integers, m and n, using only addition and subtraction.

Taofeekdboy:
I created this thread for Django aspirants, intermediate and experienced Django developers to share knowledge and projects that you have or been working on.

I have worked and been working on a lot of projects such as sport app, loan calculator, and employee management.
The one I just finished is just a social media clone project and it took a bit of my time.

The website is down below:
http://mysocialapp.pythonanywhere.com
If you are interested, you can Check and leave your comments as well.

So let's share ideas and knowledge.....

Tajbol4splend:
Even when you have a browsing phone

ruphytelecom:
If you cannot do great things, do small things in a great way.
Napoleon Hill

progeek37:
Okay. I created two groups. One for coding programming problems, where programmers meet and code together. And another group for tutorial. The tutorial group is not free. You have to pay as little as 6000 for three months. It is going to be done through WhatsApp and Zoom app, download Zoom app from playstore. We will be using it for screen sharing during the tutorial.

aanuoluwami14:
Yes, I need a responsible one

Tonymegabush1:
Bro chill..... Turf moor (molineux stadium) is not a place u visit and go home with 3points last last u fit dey draw expeciary if u are a big, check all d big teams dis season non won there, city went home with a draw, Liverpool draw, arsenal lost, Chelsea too lost dnt really know abt spur but I know dem didn't win either...... Honestly There was never a time I expected man u to win wolves..