Company Logo

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

Lesson 1 of 39 • 163 upvotes • 9:15 mins

Nisha Mittal

In this course we will cover all important topics of Data structure for NTA NET computer science, KVS PGT aspirants. Also here we 'll cover important theory from the examination point of view as well.

1

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

9:15 mins

2

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

10:17 mins

3

Stack and Queue related question ( in Hindi )

8:59 mins

4

Data Structure previous year Question (in Hindi )

10:21 mins

5

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

10:42 mins

6

How to solve postfix expressions (in Hindi)

11:15 mins

7

Heap related objective questions (in Hindi )

7:46 mins

8

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

7:27 mins

9

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

6:42 mins

10

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

8:14 mins

11

In order Tranversal in short (in Hindi )

4:52 mins

12

Post Order Free Tranversal (in Hindi )

4:01 mins

13

Pre Order Tranversal (in Hindi )

5:18 mins

14

Binary Tree Rules (in Hindi )

2:39 mins

15

Evaluate expression (in Hindi )

3:07 mins

16

Conversion (in Hindi )

2:22 mins

17

Dec 2015 Inorder Tranversal (in Hindi )

8:45 mins

18

June 2016 stack Operation (in Hindi )

8:29 mins

19

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

8:43 mins

20

Consider max heap and insert an element (in Hindi )

6:15 mins

21

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

5:39 mins

22

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

5:43 mins

23

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

5:29 mins

24

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

5:08 mins

25

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

5:43 mins

26

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

6:09 mins

27

The resultant max heap ( in Hindi)

5:13 mins

28

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

5:40 mins

29

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

4:31 mins

30

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

8:15 mins

31

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

3:27 mins

32

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

5:18 mins

33

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

4:10 mins

34

Queue operations (in Hindi )

5:19 mins

35

Job sequence problem (in Hindi )

6:04 mins

36

Max heap related question (in Hindi )

5:17 mins

37

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

4:20 mins

38

Binary Search tree (in Hindi )

6:10 mins

39

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

5:11 mins

No internet connection