An Interest In:
Web News this Week
- April 2, 2024
- April 1, 2024
- March 31, 2024
- March 30, 2024
- March 29, 2024
- March 28, 2024
- March 27, 2024
November 15, 2022 05:19 am GMT
Original Link: https://dev.to/salahelhossiny/count-complete-tree-nodes-3kg5
Count Complete Tree Nodes
Given the root of a complete binary tree, return the number of the nodes in the tree.
According to Wikipedia, every level, except possibly the last, is completely filled in a complete binary tree, and all nodes in the last level are as far left as possible. It can have between 1 and 2h nodes inclusive at the last level h.
Design an algorithm that runs in less than O(n) time complexity.
class Solution(object): def countNodes(self, root): if not root: return 0 return self.countNodes(root.left) + self.countNodes(root.right) + 1
Original Link: https://dev.to/salahelhossiny/count-complete-tree-nodes-3kg5
Share this article:
Tweet
View Full Article
Dev To
An online community for sharing and discovering great ideas, having debates, and making friendsMore About this Source Visit Dev To