Scribd
Upload
129 views3 pages

Green University of Bangladesh Department of Computer Science and Engineering (CSE)

The document proposes a research project on obscure binary search trees. It discusses binary search trees, which store data in a sorted order with internal nodes having keys greater than nodes to the left and less than nodes to the right. The project aims to learn about lesser known implementations of self-balancing binary search trees beyond common ones like AVL trees and red-black trees, giving examples like AA trees and splay trees. The objectives are motivated by the fact that operations on binary search trees depend on tree height. The proposal lists tools needed like a PC, code blocks, and sorting algorithms. It concludes by explaining that a perfect binary tree has all interior nodes with two children and all leaf nodes at the same depth.

Uploaded by

Himel
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
129 views3 pages

Green University of Bangladesh Department of Computer Science and Engineering (CSE)

The document proposes a research project on obscure binary search trees. It discusses binary search trees, which store data in a sorted order with internal nodes having keys greater than nodes to the left and less than nodes to the right. The project aims to learn about lesser known implementations of self-balancing binary search trees beyond common ones like AVL trees and red-black trees, giving examples like AA trees and splay trees. The objectives are motivated by the fact that operations on binary search trees depend on tree height. The proposal lists tools needed like a PC, code blocks, and sorting algorithms. It concludes by explaining that a perfect binary tree has all interior nodes with two children and all leaf nodes at the same depth.

Uploaded by

Himel
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/ 3

Green University of Bangladesh

Department of Computer Science and Engineering (CSE)


Faculty of Sciences and Engineering
(Semester: Fall, Year: 2022), B.Sc. in CSE(Day)

PROJECT PROPOSAL NO #01


Course Title: Data Structure Lab
Course Code: CSE 106 Section: D-21

Project Proposal Title: Research project on Obscure binary search trees

Student Details

Name ID

Toyhid Shikdar 221002149

 Submission Date : 6.12.2022


 Course Teacher’s Name : Shimul Dey Katha

[For Teachers use only: Don’t Write Anything inside this box]

Report Status
Marks: ………………………….. Signature:.....................
Comments:....................................... Date:..............................
TITTLE OF THE PROJECT PROPOSAL
Research Project on Obscure binary search trees

Problem Domain and Motivation:

In computer science, a binary search tree (BST), also called


an ordered or sorted binary tree, is a rooted binary tree data
structure with the key of each internal node being greater than all
the keys in the respective node's left subtree and less than the ones
in its right subtree. The time complexity of operations on the binary
search tree is directly proportional to the height of the tree.

Objectives & Aims:

Items, such as names, numbers, etc. can be stored in memory in a


sorted order called binary search trees or BSTs. And some of these
data structures can automatically balance their height when
arbitrary items are inserted or deleted. Therefore, they are known
as self-balancing BSTs. Further, there can be different
implementations of this type, like the BTrees, AVL trees, and red-
black trees. But there are many other lesser-known executions that
you can learn about. Some examples include AA trees, 2-3 trees,
splay trees, scapegoat trees, and treaps. 

Tools and Technologies:


1. Pc or laptop
2. Code blocks
3. Operating system
4. Compiler
5. Sorting algorithm

Conclusion:
Any binary tree is said to be perfect when all the interior nodes
have exactly two children, and at the same time, every leaf node
has the same depth. We can understand this better with an
example of an ancestry chart. Here, each person will have exactly
two biological parents. The only condition here is that the mother
and father should be placed on the same side every time so that
their gender can be used as an analogy for the left and right nodes.
With this, we can say that a perfect tree is always a complete tree,
but every complete tree is not necessarily a perfect one.

You might also like