Please Login To Continue
Finding Minimum and Maximum Value of a Tree
Lesson 7 of 16 • 1 upvotes • 12:14mins
Surya Teja Achanta
This lesson is about the implementation of functions,which find the minimum and maximum value of a given binary tree.
Trees and Heaps
16 lessons • 3h 3m
1
Course Overview
3:38mins
2
Introduction to Trees
10:45mins
3
Implementation of Binary Tree
11:46mins
4
Tree Traversals
11:07mins
5
Implementation of Breadth First Traversal
10:48mins
6
Implementation of Depth First Traversal
14:42mins
7
Finding Minimum and Maximum Value of a Tree
12:14mins
8
Implementation of a Binary Search Tree
9:55mins
9
Finding Height of a Given Binary Tree
9:48mins
10
Vertical Order Traversal of a Binary Tree
11:43mins
11
Converting Given Binary Tree into its Mirror Tree
9:43mins
12
Deleting a Node from Binary Search Tree
14:10mins
13
Introduction to Heap Data Structure
8:39mins
14
Implementation of Min Heap
14:48mins
15
Implementation of Max Heap
14:36mins
16
Printing Level of Each Node of Heap
14:37mins
Crack Programming with Unacademy
Get subscription and access unlimited live and recorded courses from India's best educators
Structured syllabus
Daily live classes
Ask doubts
