A complete binary tree has a property that the value at each node is at least as large as the values
Answers
Answered by
0
Explanation:
✍✍✍✍✍In a FULL BINARY TREE each node has exactly 0 or 2 children and all leaf nodes are on the same level.
✍✍✍✍3) COMPLETE BINARY TREE: A Binary Tree is complete Binary Tree if all levels are completely filled except possibly the last level and the last level has all keys as left as possible.
Answered by
1
A Binary Tree is complete Binary Tree if all levels are completely filled except possibly the last level and the last level has all keys as left as possible.
Similar questions