Xoviabcs's video: 43 Data Structures in C: Introduction to Trees Binary Trees

Data Structures in C Trees: Array & Linked List Representation, Binary trees & Operations on binary trees: create, findchild, findparent. Tree represents the nodes connected by edges. We will discuss binary tree or binary search tree specifically. Binary Tree is a special datastructure 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. A binary tree is a structure comprising nodes, where each node has the following 3 components: - Data element: Stores any kind of data in the node - Left pointer: Points to the tree on the left side of node - Right pointer: Points to the tree on the right side of the node This C Programming lecture contains the following topics: - Summary of list, stack, queue - Introduction to Trees - Motivation using family tree - Representation of a tree: array representation, linked list and leftmost child right sibling representation - Binary trees - Operations on binary trees: create, findchild, findparent C Programming Tutorial/ Lectures/ Course with Data Structures & Algorithms @ https://goo.gl/K6VbgL Machine Learning Complete Tutorial/Lectures/Course from IIT (nptel) for GATE @ https://goo.gl/AurRXm Discrete Mathematics for Computer Science for GATE @ https://goo.gl/YJnA4B (IIT Lectures for GATE) Best Programming Courses @ https://goo.gl/MVVDXR Operating Systems Lecture/Tutorials from IIT for GATE CSE @ https://goo.gl/GMr3if MATLAB Tutorials for GATE @ https://goo.gl/EiPgCF