to enroll in courses, follow best educators, interact with the community and track your progress.
Enroll
159
Data Structures Part - 1 (in Hindi)
1,948 plays

More
This lesson describes the important concepts of data structures.

Sandeep
Co-founder of BSI Academy and running YouTube channel. 5 years of teaching experience. Qualified in UGC NET & CSIR in Computer Science as JR

sr mcq hr computers topic c pls class?
1. NTA UGC NET Paper -2

2. Computer Science & Applications

3. About Me Sandeep M.Tech (IT) from IIIT CSIR (Engineering Science) as JRF UGC NET (JRF) - Computer Science & Applications Worked as Software Engineer & Research Scientist

4. Data Structure

5. Part 01

6. unacademy Follow me on the Unacademy Learning App 127.1k Sandeep Singh Educator since May 201 Co-founder of BSI Academy. 5 years of teaching Qualified in UGC NET in Computer Science and its Get updates about new courses Watch all my lessons Application as JRF& lecturer 14.7k 0 34 Follow . Download slides and watch offline All courses Q Sandeep Singh HINDI Programming in C&C (Hindi) Concepts of Objects Oriented Programming: CBSE UGC NET 0(6 ratings Sandeep Singh

7. Tree Tree represents the nodes connected by edges.

8. Binary Tree Binary Tree is a special data structure used for data storage purposes. A binary tree has a special condition that each node can have a maximum of two children. A binary tree has the benefits of both an ordered array and a linked list as search is as quick as in a sorted array and insertion or deletion operation are as fast as in linked list.

9. Important Terms Path - Path refers to the sequence of nodes along the edges of a tree. .Root-The node at the top of the tree is called root. There is only one root per tree and one path from the root node to any node. Parent Any node except the root node has one edge upward to a node called parent.

10. Child - The node below a given node connected by its edge downward is called its child node. Leaf - The node which does not have any child node is called the leaf node. Sub-tree - Sub-tree represents the descendants of a node.

11. Strictly Binary Tree If every non leaf node in binary tree has non empty left and right sub-trees . then the tree is called a strictly binary tree.

12. Binary Tree Traversal Methods In a traversal of a binary tree, each element of the binary tree is visited exactly once. During the visit of an element, all action (make a clone, display, evaluate the operator, etc.) with respect to this element is taken.