Скачать или смотреть Size, sum, Max, Min, Find in BST | Binary Search Tree | In English | Java | Video_3

Please consume this content on nados.pepcoding.com for a richer experience. It is necessary to solve the questions while watching videos, nados.pepcoding.com enables that.

NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. Description:
In this we have to complete different functions:- size(return total number of nodes),sum(total sum of all nodes),max(maximum value in bst),min(minimum value in bst),find(return true if given data is found else false).

Question Name:
Size, Sum, Max, Min, Find In Bst

Question Link:
https://pepcoding.com/resources/onlin...

Question Statement:
1. You are given a partially written BST class.
2. You are required to complete the body of size, sum, max, min and find function. The functions are expected to:
2.1. size - return the number of nodes in BST
2.2. sum - return the sum of nodes in BST
2.3. max - return the value of node with greatest value in BST
2.4. min - return the value of node with smallest value in BST
2.5. find - return true if there is node in the tree equal to "data"
3. Input and Output is managed for you.

Topic: #Tree #BinaryTree #BinarySearchTree #BST

Used #DataStructure #Recursion

#TimeComplexity: O(N)

#SpaceComplexity: O(1),without considering the recursion space.
--------------------------------------------------------------

More Youtube PlayList:

Level 1 In Java English :    • Java Level 1 In English  
Level 1 In Java Hindi :    • DSA - Level 1  
Level 2 In Java Hindi :    • DSA - Level 2  
Constructive Algorithm - Level 3 :    • Constructive Algorithm - Level 3  
Geometry - Level 3 :    • Geometry Level 3  
Maths for CP - Level 3 :    • Maths For CP - Level 3  
DP - Level 3 :    • DP - Level 3  
Euler Tour - Level 3 :    • Euler Tour - Level 3  
Ternary Search :    • Ternary Search  
Recursion & Backtracking - Level 1 :    • Recursion & Backtracking - Level 1  
Recursion & Backtracking - Level 2 :    • Backtracking - Level 2  
Graphs - Level 1 :    • Graphs - Level 1  
Dyanmic Programming - Level 1 :    • Dynamic Programming - Level 1  
Generic Trees - Level 1 :    • Generic Trees - Level 1  
Time and Space - Level 1 :    • Time and Space - Level 1  



---------------------------------------------------------------

Pepcoding has taken the initiative to provide counselling and learning resources to all curious, skillful and dedicated Indian coders. This video is part of the series to impart industry-level web development and programming skills in the community.



We also provide professional courses with live classes and placement opportunities.


For more visit our website: https://bit.ly/2ZCS68a
For more free study resources, visit: https://bit.ly/3liICaJ
Have a look at our result: https://bit.ly/2YcmDZR

Follow us on our Youtube page:    / pepcoding  
Follow us on our FB page:   / pepcoding  
Follow us on Instagram:   / pepcoding  
Follow us on LinkedIn:   / pepcoding-education  
Follow us on Pinterest:   / _created  
Follow us on Twitter:   / pepcoding  


.

.

.

Happy Programming !!! Pep it up

----------------------------------------------------------------

#Tree #BinaryTree #BinarySearchTree #BST #BT #size #sum #max #min #findinbst #tree #size


=================================================================