Given a sorted (increasing order) array, write an algorithm to create a binary
tree with minimal height.
In this I am not getting is that how we can store binary tree as an array.
amit.hak50 0 Junior Poster in Training
Recommended Answers
Jump to PostIt is called a Binary Heap when you are storing it as an array. http://en.wikipedia.org/wiki/Binary_heap (that may not be the best resource, it is a little hard to understand - but start googling …
All 3 Replies
cale.macdonald 4 Junior Poster
Given a sorted (increasing order) array, write an algorithm to create a binary
tree with minimal height.
In this I am not getting is that how we can store binary tree as an array.
From my understanding on how you wrote this, you need to go from an array to a binary tree.
amit.hak50 0 Junior Poster in Training
what you want to say???
BestJewSinceJC 700 Posting Maven
It is called a Binary Heap when you are storing it as an array. http://en.wikipedia.org/wiki/Binary_heap (that may not be the best resource, it is a little hard to understand - but start googling "binary heap" and you'll find numerous useful articles).
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.