69 CS651 Lecture Notes - Lecture 44: Binary Search Tree, Binary Tree, Dynamic Programming

5 views2 pages

Document Summary

Search | lesson 44 | dsa in java | For example, we make a node consider this one two three four, five, six and seven okay just make another so this is our binary. What we are going to do is to see if my root of data is equal to the element. Then in that case what we will do just written true cool that is okay, okay now it might it might be case that okay. Consider we are looking for nine right, so what will happen it will check for with one right. each tree is having two two sub trees or you could say like two or two child nodes. We are actually we can actually simplify these two results. How can we do we can say hey you have to retur n right or here.

Get access

Grade+
$40 USD/m
Billed monthly
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
10 Verified Answers
Class+
$30 USD/m
Billed monthly
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
7 Verified Answers

Related Documents

Related Questions