Scribd
Upload
19 views7 pages

Advanced Programmin Lab Worksheet4

cu Advanced programmin lab work

Uploaded by

Soyam Kumar Gupta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
19 views7 pages

Advanced Programmin Lab Worksheet4

cu Advanced programmin lab work

Uploaded by

Soyam Kumar Gupta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 7

DEPARTMENT OF

COMPUTER SCIENCE &

Experiment 4
Student Name:
Branch: BE-CSE Section/Group:
Semester: 6th Date of Performance:17/02/25
Subject Name: Advanced Programming-2 Code: 22CSP-351

1. Aim: To learn about the concept of non-linear structure.


2. Objective: To understand the implementation of the tree data structure.
3. Implementation-Code & Output:

P.no-
https://leetcode.com/problems/binary-tree-level-order-traversal/description/
DEPARTMENT OF
COMPUTER SCIENCE &

P.no-
https://leetcode.com/problems/binary-tree-inorder-traversal/description/ (Iter
ative)

P.no- https://leetcode.com/problems/binary-tree-zigzag-level-order-
traversal/description/
DEPARTMENT OF
COMPUTER SCIENCE &

P.no- https://leetcode.com/problems/construct-binary-tree-from-preorder-
and-inorder-traversal/description/

P.no- https://leetcode.com/problems/path-sum-ii/description/
DEPARTMENT OF
COMPUTER SCIENCE &

P.no-
https://leetcode.com/problems/flatten-binary-tree-to-linked-list/description/

P.no-
https://leetcode.com/problems/binary-tree-preorder-traversal/description/ (ite
rative)
DEPARTMENT OF
COMPUTER SCIENCE &

P.no- https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-
tree/description/

P.no- https://leetcode.com/problems/binary-tree-cameras/description/
DEPARTMENT OF
COMPUTER SCIENCE &

P.no- https://leetcode.com/problems/vertical-order-traversal-of-a-binary-
tree/description/

4. Learning Outcome
DEPARTMENT OF
COMPUTER SCIENCE &

1. Understand Tree Concepts – Learn the fundamental concepts of tree data structures,
including types of trees (binary trees, BSTs, AVL trees, etc.), terminologies (nodes,
edges, root, leaves, height, depth), and their real-world applications.
2. Implement Tree Operations – Gain the ability to implement basic tree operations
such as insertion, deletion, traversal (preorder, inorder, postorder, level-order), and
searching in different types of trees.
3. Analyze Tree Efficiency – Evaluate the time and space complexities of various tree
operations and understand how balanced and unbalanced trees impact performance.
4. Apply Trees in Problem Solving – Use tree structures to solve problems in areas
such as database indexing, hierarchical data representation, and expression evaluation.
5. Implement Advanced Trees – Explore and implement advanced tree structures like
AVL trees, B-trees, and Trie, and understand their significance in optimizing search
and storage operations.

You might also like