Please Login To Continue

Find In order, post order and pre order (in Hindi )

Lesson 25 of 39 • 48 upvotes • 5:43mins

Avatar

Nisha Mittal

Continue on app
1

Data Structure course overview and tips to crack exam(in Hindi )

9:15mins

2

Binary Tree , Binary Search Tree and Heap of Data Structure (in Hindi )

10:17mins

3

Stack and Queue related question ( in Hindi )

8:59mins

4

Data Structure previous year Question (in Hindi )

10:21mins

5

Learn in order and post order use to find pre order of Tree (in Hindi )

10:42mins

6

How to solve postfix expressions (in Hindi)

11:15mins

7

Heap related objective questions (in Hindi )

7:46mins

8

Learn to add new element in a Heap (in Hindi )

7:27mins

9

Learn to Calculate Different Binary Trees with N Nodes (in Hindi)

6:42mins

10

How to Search a Number in Binary Search Tree (in Hindi )

8:14mins

11

In order Tranversal in short (in Hindi )

4:52mins

12

Post Order Free Tranversal (in Hindi )

4:01mins

13

Pre Order Tranversal (in Hindi )

5:18mins

14

Binary Tree Rules (in Hindi )

2:39mins

15

Evaluate expression (in Hindi )

3:07mins

16

Conversion (in Hindi )

2:22mins

17

Dec 2015 Inorder Tranversal (in Hindi )

8:45mins

18

June 2016 stack Operation (in Hindi )

8:29mins

19

How many Gates required after simplification of boolean expression (in Hindi)

8:43mins

20

Consider max heap and insert an element (in Hindi )

6:15mins

21

Use in order and pre order to find post order (in Hindi)

5:39mins

22

What is the inorder traversal sequence of the resultant tree? (In Hindi )

5:43mins

23

What is the height of the binary search tree (in Hindi )

5:29mins

24

Which is correct in order traversal sequence(s) of binary search tree(s)?( In Hindi )

5:08mins

25

Find In order, post order and pre order (in Hindi )

5:43mins

26

Post order tranversal of tree is given, find in order of BST (in Hindi)

6:09mins

27

The resultant max heap ( in Hindi)

5:13mins

28

Which of the following binary trees has its inorder and preorder traversals given in Hindi

5:40mins

29

The order in which the nodes are visited during an in tree ( in Hindi )

4:31mins

30

Binary Search Tree (BST) stores values in the range 37 to 573( in Hindi )

8:15mins

31

The sequence of the value popped out is (in Hindi )

3:27mins

32

Which of the following permutation can be obtained in same order using stack( in Hindi )

5:18mins

33

The number of nodes in left and right subtree( in Hindi )

4:10mins

34

Queue operations (in Hindi )

5:19mins

35

Job sequence problem (in Hindi )

6:04mins

36

Max heap related question (in Hindi )

5:17mins

37

Binary Search tree left and right subtree child (in Hindi )

4:20mins

38

Binary Search tree (in Hindi )

6:10mins

39

Maximum number of nodes in a tree same post and pre order (in Hindi )

5:11mins

Crack NTA-UGC-NET & SET Exams with Unacademy

Get subscription and access unlimited live and recorded courses from India's best educators
Structured syllabus
Structured syllabus
Daily live classes
Daily live classes
Ask doubts
Ask doubts
Tests & practice
Tests & practice

More from Nisha Mittal

thumbnail
HindiComputer Science & Application

Tips and Tricks for Composite Transformation

Nisha Mittal

Similar Plus Courses

Unacademy is India’s largest online learning platform. Download our apps to start learning


Starting your preparation?

Call us and we will answer all your questions about learning on Unacademy

Call +91 8585858585
Company
About usShikshodayaCareersBlogsPrivacy PolicyTerms and Conditions
Products
Learner appLearner appEducator appEducator appParent appParent app