Data Structure: Unit III: Trees

Trees ADT

Definition, Example Operations | Data Structure

Home | Department: CSE Department | Subject: Data Structure |
Next >>

A tree is a finite set of one or more nodes such that -There is a specially designated node called root.

Trees ADT

A tree is a finite set of one or more nodes such that -

i) There is a specially designated node called root.

ii) The remaining nodes are partitioned into n >= 0 disjoint sets T1, T2, T3...Tn

T1,T2T3, ...T are called the sub-trees of the root.

The concept of tree is represented by following Fig. 4.1.1.

Various operations that can be performed on the tree data structure are -

1. Creation of a tree.

2. Insertion of a node in the tree as a child of desired node.

3. Deletion of any node(except root node) from the tree.

4. Modification of the node value of the tree.

5. Searching particular node from the tree.

Data Structure: Unit III: Trees : Tag: : Definition, Example Operations | Data Structure - Trees ADT

Home | Department: CSE Department | Subject: Data Structure |
Next >>

Data Structure: Unit III: Trees


Trees ADT - Definition, Example Operations | Data Structure

Basic Terminologies in Trees - ADT Data Structure

Binary Tree ADT - Definition, Syntax, Example Operations | Data Structure

Types of Binary Tree - ADT Data Structure

Representation of Tree - ADT Data Structure

Tree Traversal - Definition, Algorithm with Example C Programs | ADT Data Structure

Expression Trees - Definition, Algorithm with Example C Programs | ADT Data Structure

Applications of Trees - ADT Data Structure

Binary Search Tree ADT - Operations, Algorithm with Example C Programs | Data Structure

Threaded Binary Trees - Operations, Structure, Algorithm with Example C Programs, Advantages, Disadvantage | ADT Data Structure

Constructing Binary Search Tree from Traversals - ADT Data Structure

C Programming Examples on Binary Trees - ADT Data Structure

AVL Trees - Definition, Theorem, Algorithm with Example C Programs | ADT Data Structure

Binary Heap - Definition, Types, Algorithm with Example C Programs | ADT Data Structure

Priority Queue Heaps - Operations, Algorithm with Example C Programs | Trees ADT | Data Structure

Under Subject


Data Structure

Data Structure

CS3301 3rd Semester CSE Dept | 2021 Regulation | 3rd Semester CSE Dept 2021 Regulation


Related Subjects


Discrete Mathematics

Discrete Mathematics

MA3354 3rd Semester CSE Dept | 2021 Regulation | 3rd Semester CSE Dept 2021 Regulation

Digital Principles and Computer Organization

Digital Principles and Computer Organization

CS3351 3rd Semester CSE Dept | 2021 Regulation | 3rd Semester CSE Dept 2021 Regulation

Foundation of Data Science

Foundation of Data Science

CS3352 3rd Semester CSE Dept | 2021 Regulation | 3rd Semester CSE Dept 2021 Regulation

Data Structure

Data Structure

CS3301 3rd Semester CSE Dept | 2021 Regulation | 3rd Semester CSE Dept 2021 Regulation

Object Oriented Programming

Object Oriented Programming

CS3391 3rd Semester CSE Dept | 2021 Regulation | 3rd Semester CSE Dept 2021 Regulation