Test Series

Question

Comments

If starting node is root then i am getting 128..

---

plz elaborate

---

Is it correct?

---

@MiNiPanda

in the question they didn't mention, no.of nodes in the BST

For getting maximum, did you consider it is Perfect BST?

---

Yes as they wanted maximum so we should consider perfect BST

---

@MiniPanda

Can you please explain your solution.

As I couldn't solve.

Thanks

---

@Mayankprakash
See the answer in this post.. if you have doubt then ask.

Answer 1

for Maximum result we take Perfect Binary Search Tree

If we take complete  binary tree of height = 3

no of internal nodes = 7

Each internal node has 2 choices

therefore  , max No of BFS traversal  = 2^7

Comments

@Magma: Not getting your solution...can you explain it with example...

---

Shaik Masthan

Can u give me some link where the definition of a complete binary tree or perfect binary tree or almost Complete binary tree or full tree are given ??

---

@akash.dinkar12

https://www.geeksforgeeks.org/binary-tree-set-3-types-of-binary-tree/