Learning Tree Data structure [Java]
Breadth First Search and Depth First Search in Trees
Development,Software Engineering,Data Structures
Lectures -6
Duration -51 mins
30-days Money-Back Guarantee
Get your team access to 10000+ top Tutorials Point courses anytime, anywhere.
Course Description
This course explains how we can solve problems involving Tree data structure. First, the concept is explained in white board and then the solution is coded for better understanding.
When we see a tree data structure, the first thing we need to identify is to use either Breadth-first Search or Depth-first search. This course differentiates the Breadth-first search and Depth-first search problems and the different techniques used in them.
Depth First search uses recursion. It is very hard to visualize recursion. This course uses a debugger and this helps in visualizing the code flow.
What is Tree data structure?
A tree is non-linear and a hierarchical data structure consisting of a collection of nodes such that each node of the tree stores a value and a list of references to other children nodes.
Applications :
Store hierarchical data, like folder structure, organization structure, and XML/HTML data.
A Search Tree is a tree that allows fast search, insert, and deletion of sorted data. It also allows finding the closest item
Heap is a tree data structure that is implemented using arrays and used to implement priority queues.
B-Tree and B+ Tree: They are used to implement indexing in databases.
Syntax Tree: Scanning, parsing, generation of code, and evaluation of arithmetic expressions in Compiler design.
Trie: Used to implement dictionaries with prefix lookup.
Suffix Tree: For quick pattern searching in a fixed text.
Spanning Trees and shortest path trees are used in routers and bridges respectively in computer networks
etc
Who this course is for:
- Beginners and People who find it hard to work on Tree data structures can take this course
Goals
What will you learn in this course:
- A clear understanding of Tree Data structure
- How to use Breadth First Search in Tree Data structure
- How to use Depth First Search in Tree Data Structure
- Visualize the Code flow using Debugger in Leetcode
Prerequisites
What are the prerequisites for this course?
knowledge on LinkedList is needed
Curriculum
Check out the detailed breakdown of what’s inside the course
Breadth First Search
3 Lectures
- Level Order Traversal 13:05 13:05
- ZigZag traversal of tree 05:43 05:43
- Right view of Tree 04:07 04:07
Depth First Search
3 Lectures
Instructor Details
Monish Njs
eCourse Certificate
Use your certificate to make a career change or to advance in your current career.
Our students work
with the Best
Related Video Courses
View MoreAnnual Membership
Become a valued member of Tutorials Point and enjoy unlimited access to our vast library of top-rated Video Courses
Subscribe nowOnline Certifications
Master prominent technologies at full length and become a valued certified professional.
Explore Now