Scribd
Upload
20 views9 pages

DM Online Lecture 11,12

The document discusses different types of trees used in computer science including binary trees and binary search trees. It covers tree traversal methods and different notations used to represent expressions using trees.

Uploaded by

Shohidul Islam Sovon
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
20 views9 pages

DM Online Lecture 11,12

The document discusses different types of trees used in computer science including binary trees and binary search trees. It covers tree traversal methods and different notations used to represent expressions using trees.

Uploaded by

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

DM_Online_Lecture 11,12

Introduction to Trees:

Page 1|9
Page 2|9
Binary Tree:
In computer science, a binary tree is a tree data structure in which each node has at most two
children, which are referred to as the left child and the right child.

Binary Search Tree:


The use of a binary search tree, which is a binary tree in which each child of a vertex is designated
as a right or left child, no vertex has more than one right child or left child, and each vertex is
labeled with a key, which is one of the items. Furthermore, vertices are assigned keys so that the
key of a vertex is both larger than the keys of all vertices in its left subtree and smaller than the
keys of all vertices in its right subtree.

Page 3|9
Tree Traversal:

Page 4|9
Page 5|9
Page 6|9
Page 7|9
Infix, Prefix, and Postfix Notation:

Page 8|9
Lecture Prepared by

Md. Javed Hossain, Associate Professor, CSTE, NSTU.


Page 9|9

You might also like