hii i finished these topics 1.linked list 2.stack and queues.how much time will it take me to finish trees 1.binary tee 2.avl tree 3.b-tree 4.binary search 5.threaded binary tree??? actualy ill try through linked list will it be easy???
rithish
13
Junior Poster in Training
Recommended Answers
Jump to PostIt does it recursively. It goes down the correct path until it reaches the correct position. (at which point *leaf will be NULL)
You seem to implement a binary search tree although you cannot insert the same value more than once. I do not know if this is desired but …
Jump to PostI'm not sure what there is not to understand about it. You start with a bigger problem then you express that into a smaller problem until you reach a base case.
The base case here would be reaching a node that is null and reducing the problem happens because insert(n) …
Jump to PostThat function prints the elements of the tree from low to high. Try to not think about what happens in the recursion but think of it as reducing the problem.
If basically says this:
If you have a node to look at: 1. First print it's left …
All 11 Replies
rithish
13
Junior Poster in Training
rithish
13
Junior Poster in Training
Gonbe
32
Newbie Poster
rithish
13
Junior Poster in Training
rithish
13
Junior Poster in Training
Gonbe
32
Newbie Poster
rithish
13
Junior Poster in Training
rithish
13
Junior Poster in Training
Gonbe
32
Newbie Poster
rithish
13
Junior Poster in Training
Gonbe
32
Newbie Poster
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.